./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-word-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 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:03:58,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:03:58,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:03:58,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:03:58,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:03:58,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:03:58,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:03:58,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:03:58,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:03:58,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:03:58,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:03:58,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:03:58,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:03:58,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:03:58,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:03:58,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:03:58,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:58,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:58,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:03:58,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:03:58,929 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2025-01-10 01:03:59,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:03:59,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:03:59,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:03:59,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:03:59,141 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:03:59,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-10 01:04:00,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc12cbcca/4297790f5cc94e219846d98077858de4/FLAGa508c8673 [2025-01-10 01:04:00,509 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:04:00,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2025-01-10 01:04:00,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc12cbcca/4297790f5cc94e219846d98077858de4/FLAGa508c8673 [2025-01-10 01:04:00,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc12cbcca/4297790f5cc94e219846d98077858de4 [2025-01-10 01:04:00,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:04:00,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:04:00,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:00,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:04:00,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:04:00,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d894c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:00, skipping insertion in model container [2025-01-10 01:04:00,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:04:00" (1/1) ... [2025-01-10 01:04:00,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:04:01,022 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:04:01,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:01,032 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:04:01,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:04:01,080 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:04:01,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01 WrapperNode [2025-01-10 01:04:01,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:04:01,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:01,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:04:01,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:04:01,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,118 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 158 [2025-01-10 01:04:01,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:04:01,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:04:01,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:04:01,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:04:01,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,153 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-01-10 01:04:01,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,160 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,165 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:04:01,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:04:01,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:04:01,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:04:01,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (1/1) ... [2025-01-10 01:04:01,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:04:01,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:01,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:04:01,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:04:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:04:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:04:01,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:04:01,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:04:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:04:01,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:04:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:04:01,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:04:01,251 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:04:01,353 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:04:01,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:04:01,658 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:04:01,659 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:04:01,863 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:04:01,869 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:04:01,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:01 BoogieIcfgContainer [2025-01-10 01:04:01,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:04:01,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:04:01,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:04:01,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:04:01,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:04:00" (1/3) ... [2025-01-10 01:04:01,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7ee061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:01, skipping insertion in model container [2025-01-10 01:04:01,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:04:01" (2/3) ... [2025-01-10 01:04:01,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7ee061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:04:01, skipping insertion in model container [2025-01-10 01:04:01,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:04:01" (3/3) ... [2025-01-10 01:04:01,879 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-01-10 01:04:01,891 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:04:01,892 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 85 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-01-10 01:04:01,893 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:04:01,948 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:04:01,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 96 transitions, 213 flow [2025-01-10 01:04:01,997 INFO L124 PetriNetUnfolderBase]: 12/93 cut-off events. [2025-01-10 01:04:01,999 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:04:02,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 12/93 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 312 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2025-01-10 01:04:02,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 96 transitions, 213 flow [2025-01-10 01:04:02,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 92 transitions, 202 flow [2025-01-10 01:04:02,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:04:02,016 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;@28118c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:04:02,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-01-10 01:04:02,018 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:04:02,018 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:04:02,018 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:04:02,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:02,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:04:02,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:02,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 733586, now seen corresponding path program 1 times [2025-01-10 01:04:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162070905] [2025-01-10 01:04:02,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:02,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:04:02,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:04:02,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:02,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:02,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:02,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162070905] [2025-01-10 01:04:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162070905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:02,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:04:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61842800] [2025-01-10 01:04:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:02,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:04:02,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:02,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:04:02,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:04:02,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:02,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:02,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:02,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:02,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:02,693 INFO L124 PetriNetUnfolderBase]: 2448/4347 cut-off events. [2025-01-10 01:04:02,694 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-01-10 01:04:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7728 conditions, 4347 events. 2448/4347 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28595 event pairs, 1480 based on Foata normal form. 1/2933 useless extension candidates. Maximal degree in co-relation 7270. Up to 3217 conditions per place. [2025-01-10 01:04:02,736 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 42 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-01-10 01:04:02,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 280 flow [2025-01-10 01:04:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:04:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:04:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-01-10 01:04:02,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-01-10 01:04:02,746 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 202 flow. Second operand 3 states and 189 transitions. [2025-01-10 01:04:02,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 280 flow [2025-01-10 01:04:02,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 268 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:04:02,761 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 184 flow [2025-01-10 01:04:02,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-01-10 01:04:02,769 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -9 predicate places. [2025-01-10 01:04:02,769 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 184 flow [2025-01-10 01:04:02,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:02,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:02,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:04:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:04:02,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:02,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 733587, now seen corresponding path program 1 times [2025-01-10 01:04:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405897410] [2025-01-10 01:04:02,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:02,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:04:02,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:04:02,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:02,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:03,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405897410] [2025-01-10 01:04:03,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405897410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:03,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:03,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:04:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902548072] [2025-01-10 01:04:03,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:03,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:03,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:03,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:03,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:03,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:03,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:03,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:03,508 INFO L124 PetriNetUnfolderBase]: 2449/4350 cut-off events. [2025-01-10 01:04:03,508 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:04:03,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7636 conditions, 4350 events. 2449/4350 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28605 event pairs, 1480 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 7599. Up to 3230 conditions per place. [2025-01-10 01:04:03,531 INFO L140 encePairwiseOnDemand]: 91/96 looper letters, 46 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2025-01-10 01:04:03,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 90 transitions, 290 flow [2025-01-10 01:04:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:04:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:04:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-01-10 01:04:03,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6223958333333334 [2025-01-10 01:04:03,535 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 184 flow. Second operand 4 states and 239 transitions. [2025-01-10 01:04:03,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 90 transitions, 290 flow [2025-01-10 01:04:03,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 90 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:03,538 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 207 flow [2025-01-10 01:04:03,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-01-10 01:04:03,539 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -6 predicate places. [2025-01-10 01:04:03,540 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 207 flow [2025-01-10 01:04:03,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:03,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:03,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:04:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:04:03,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 22744475, now seen corresponding path program 1 times [2025-01-10 01:04:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:03,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553647060] [2025-01-10 01:04:03,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:04:03,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:04:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:03,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553647060] [2025-01-10 01:04:03,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553647060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:03,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:03,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:03,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152539041] [2025-01-10 01:04:03,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:03,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:03,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:03,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:03,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:03,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:03,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:03,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:03,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:03,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:04,337 INFO L124 PetriNetUnfolderBase]: 2450/4353 cut-off events. [2025-01-10 01:04:04,337 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-01-10 01:04:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7653 conditions, 4353 events. 2450/4353 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28639 event pairs, 1480 based on Foata normal form. 0/2934 useless extension candidates. Maximal degree in co-relation 7628. Up to 3229 conditions per place. [2025-01-10 01:04:04,358 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 46 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-01-10 01:04:04,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 93 transitions, 319 flow [2025-01-10 01:04:04,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:04,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-01-10 01:04:04,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020833333333333 [2025-01-10 01:04:04,360 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 207 flow. Second operand 5 states and 289 transitions. [2025-01-10 01:04:04,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 93 transitions, 319 flow [2025-01-10 01:04:04,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 93 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:04,362 INFO L231 Difference]: Finished difference. Result has 89 places, 93 transitions, 241 flow [2025-01-10 01:04:04,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=89, PETRI_TRANSITIONS=93} [2025-01-10 01:04:04,363 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-01-10 01:04:04,363 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 93 transitions, 241 flow [2025-01-10 01:04:04,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.8) internal successors, (239), 5 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:04,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:04,363 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:04:04,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:04:04,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:04,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 705000515, now seen corresponding path program 1 times [2025-01-10 01:04:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983382824] [2025-01-10 01:04:04,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:04:04,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:04:04,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:04,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983382824] [2025-01-10 01:04:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983382824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:04,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310193619] [2025-01-10 01:04:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:04,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:04,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:04,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:04,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:04:04,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:04:04,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:04:04,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:04,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:04,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-10 01:04:04,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:04,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:04:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:04,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310193619] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:04,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:04,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:04:04,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368784025] [2025-01-10 01:04:04,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:04,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:04,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:04,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:04,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:05,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:05,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 93 transitions, 241 flow. Second operand has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:05,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:05,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:05,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:06,006 INFO L124 PetriNetUnfolderBase]: 2451/4355 cut-off events. [2025-01-10 01:04:06,006 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 01:04:06,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7676 conditions, 4355 events. 2451/4355 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28610 event pairs, 1480 based on Foata normal form. 0/2939 useless extension candidates. Maximal degree in co-relation 7638. Up to 3228 conditions per place. [2025-01-10 01:04:06,052 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 43 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2025-01-10 01:04:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 362 flow [2025-01-10 01:04:06,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 477 transitions. [2025-01-10 01:04:06,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-01-10 01:04:06,055 INFO L175 Difference]: Start difference. First operand has 89 places, 93 transitions, 241 flow. Second operand 9 states and 477 transitions. [2025-01-10 01:04:06,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 362 flow [2025-01-10 01:04:06,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:06,058 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 275 flow [2025-01-10 01:04:06,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2025-01-10 01:04:06,059 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 5 predicate places. [2025-01-10 01:04:06,060 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 275 flow [2025-01-10 01:04:06,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 48.36363636363637) internal successors, (532), 11 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:06,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:06,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:04:06,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:06,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:06,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:06,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash 705080860, now seen corresponding path program 1 times [2025-01-10 01:04:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429147001] [2025-01-10 01:04:06,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:06,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:04:06,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:04:06,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429147001] [2025-01-10 01:04:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429147001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:06,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050124052] [2025-01-10 01:04:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:06,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:06,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:06,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:06,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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-01-10 01:04:06,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:06,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:06,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:06,973 INFO L124 PetriNetUnfolderBase]: 2452/4358 cut-off events. [2025-01-10 01:04:06,973 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 01:04:06,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7694 conditions, 4358 events. 2452/4358 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28632 event pairs, 1480 based on Foata normal form. 1/2944 useless extension candidates. Maximal degree in co-relation 7648. Up to 3234 conditions per place. [2025-01-10 01:04:06,989 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 49 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2025-01-10 01:04:06,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 98 transitions, 397 flow [2025-01-10 01:04:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2025-01-10 01:04:06,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 01:04:06,990 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 275 flow. Second operand 5 states and 288 transitions. [2025-01-10 01:04:06,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 98 transitions, 397 flow [2025-01-10 01:04:06,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 348 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:04:06,993 INFO L231 Difference]: Finished difference. Result has 93 places, 98 transitions, 269 flow [2025-01-10 01:04:06,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=93, PETRI_TRANSITIONS=98} [2025-01-10 01:04:06,994 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 3 predicate places. [2025-01-10 01:04:06,994 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 269 flow [2025-01-10 01:04:06,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 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-01-10 01:04:06,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:06,994 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:04:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:04:06,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash 382628508, now seen corresponding path program 1 times [2025-01-10 01:04:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447124182] [2025-01-10 01:04:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:07,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:04:07,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:04:07,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:07,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:07,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:07,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447124182] [2025-01-10 01:04:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447124182] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:07,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505869976] [2025-01-10 01:04:07,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:07,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:07,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:07,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:07,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:04:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:04:07,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:04:07,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:07,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:07,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:04:07,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:07,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:04:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:07,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505869976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:07,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:04:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86404005] [2025-01-10 01:04:07,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:04:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:04:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:04:08,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:08,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 269 flow. Second operand has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:08,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:08,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:08,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:08,700 INFO L124 PetriNetUnfolderBase]: 2453/4360 cut-off events. [2025-01-10 01:04:08,700 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 01:04:08,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7695 conditions, 4360 events. 2453/4360 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28618 event pairs, 1480 based on Foata normal form. 0/2946 useless extension candidates. Maximal degree in co-relation 7642. Up to 3225 conditions per place. [2025-01-10 01:04:08,714 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 42 selfloop transitions, 18 changer transitions 0/100 dead transitions. [2025-01-10 01:04:08,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 100 transitions, 399 flow [2025-01-10 01:04:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 482 transitions. [2025-01-10 01:04:08,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-01-10 01:04:08,719 INFO L175 Difference]: Start difference. First operand has 93 places, 98 transitions, 269 flow. Second operand 9 states and 482 transitions. [2025-01-10 01:04:08,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 100 transitions, 399 flow [2025-01-10 01:04:08,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 391 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:08,721 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 307 flow [2025-01-10 01:04:08,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-01-10 01:04:08,721 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2025-01-10 01:04:08,721 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 307 flow [2025-01-10 01:04:08,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.30769230769231) internal successors, (628), 13 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:08,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:08,722 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:04:08,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:08,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:08,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:08,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1022102318, now seen corresponding path program 1 times [2025-01-10 01:04:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023180523] [2025-01-10 01:04:08,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:08,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:04:08,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:04:08,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:08,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023180523] [2025-01-10 01:04:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023180523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558504798] [2025-01-10 01:04:09,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:09,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:09,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:09,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:04:09,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:04:09,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:04:09,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:09,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:04:09,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:09,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:04:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:09,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558504798] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:09,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:04:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612423915] [2025-01-10 01:04:09,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:09,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:04:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:09,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:04:09,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:04:09,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:09,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 307 flow. Second operand has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:09,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:09,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:09,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:10,314 INFO L124 PetriNetUnfolderBase]: 2453/4359 cut-off events. [2025-01-10 01:04:10,314 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 01:04:10,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7705 conditions, 4359 events. 2453/4359 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 28633 event pairs, 1480 based on Foata normal form. 0/2946 useless extension candidates. Maximal degree in co-relation 7650. Up to 3226 conditions per place. [2025-01-10 01:04:10,333 INFO L140 encePairwiseOnDemand]: 87/96 looper letters, 40 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2025-01-10 01:04:10,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 420 flow [2025-01-10 01:04:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 380 transitions. [2025-01-10 01:04:10,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2025-01-10 01:04:10,335 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 307 flow. Second operand 7 states and 380 transitions. [2025-01-10 01:04:10,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 420 flow [2025-01-10 01:04:10,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 99 transitions, 387 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:04:10,337 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 307 flow [2025-01-10 01:04:10,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2025-01-10 01:04:10,337 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 7 predicate places. [2025-01-10 01:04:10,337 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 307 flow [2025-01-10 01:04:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 48.46153846153846) internal successors, (630), 13 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:10,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:10,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:10,345 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-01-10 01:04:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:10,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1472775412, now seen corresponding path program 1 times [2025-01-10 01:04:10,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:10,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742789560] [2025-01-10 01:04:10,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:10,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:10,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:04:10,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:04:10,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:10,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742789560] [2025-01-10 01:04:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742789560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:10,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819367040] [2025-01-10 01:04:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:10,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:10,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:10,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:10,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:10,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:10,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:10,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:11,161 INFO L124 PetriNetUnfolderBase]: 4369/8146 cut-off events. [2025-01-10 01:04:11,161 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 01:04:11,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14149 conditions, 8146 events. 4369/8146 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 62363 event pairs, 2500 based on Foata normal form. 114/5671 useless extension candidates. Maximal degree in co-relation 8729. Up to 3583 conditions per place. [2025-01-10 01:04:11,191 INFO L140 encePairwiseOnDemand]: 86/96 looper letters, 117 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-01-10 01:04:11,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 166 transitions, 759 flow [2025-01-10 01:04:11,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:04:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:04:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 407 transitions. [2025-01-10 01:04:11,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7065972222222222 [2025-01-10 01:04:11,193 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 307 flow. Second operand 6 states and 407 transitions. [2025-01-10 01:04:11,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 166 transitions, 759 flow [2025-01-10 01:04:11,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 166 transitions, 695 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:04:11,198 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 344 flow [2025-01-10 01:04:11,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2025-01-10 01:04:11,200 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2025-01-10 01:04:11,201 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 344 flow [2025-01-10 01:04:11,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 5 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:11,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:11,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:04:11,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1473397668, now seen corresponding path program 1 times [2025-01-10 01:04:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042586438] [2025-01-10 01:04:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:11,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:04:11,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:04:11,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:11,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042586438] [2025-01-10 01:04:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042586438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:11,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241428159] [2025-01-10 01:04:11,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:11,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:11,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:11,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 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-01-10 01:04:11,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:11,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:11,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:12,104 INFO L124 PetriNetUnfolderBase]: 7643/14384 cut-off events. [2025-01-10 01:04:12,104 INFO L125 PetriNetUnfolderBase]: For 2000/2000 co-relation queries the response was YES. [2025-01-10 01:04:12,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26316 conditions, 14384 events. 7643/14384 cut-off events. For 2000/2000 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 121594 event pairs, 4369 based on Foata normal form. 114/10305 useless extension candidates. Maximal degree in co-relation 18791. Up to 5773 conditions per place. [2025-01-10 01:04:12,162 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 115 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-01-10 01:04:12,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 168 transitions, 771 flow [2025-01-10 01:04:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:04:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:04:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 401 transitions. [2025-01-10 01:04:12,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6961805555555556 [2025-01-10 01:04:12,165 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 344 flow. Second operand 6 states and 401 transitions. [2025-01-10 01:04:12,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 168 transitions, 771 flow [2025-01-10 01:04:12,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 168 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:12,169 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 448 flow [2025-01-10 01:04:12,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2025-01-10 01:04:12,170 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2025-01-10 01:04:12,170 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 448 flow [2025-01-10 01:04:12,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 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-01-10 01:04:12,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:12,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:12,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:04:12,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 976504772, now seen corresponding path program 1 times [2025-01-10 01:04:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292383759] [2025-01-10 01:04:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:12,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:04:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:04:12,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:12,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:04:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292383759] [2025-01-10 01:04:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292383759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581905244] [2025-01-10 01:04:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:12,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:12,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:12,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:12,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:12,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 114 transitions, 448 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 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-01-10 01:04:12,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:12,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:12,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:13,215 INFO L124 PetriNetUnfolderBase]: 6652/13064 cut-off events. [2025-01-10 01:04:13,215 INFO L125 PetriNetUnfolderBase]: For 4703/4875 co-relation queries the response was YES. [2025-01-10 01:04:13,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24748 conditions, 13064 events. 6652/13064 cut-off events. For 4703/4875 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 111534 event pairs, 3987 based on Foata normal form. 174/9384 useless extension candidates. Maximal degree in co-relation 18096. Up to 6012 conditions per place. [2025-01-10 01:04:13,282 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 112 selfloop transitions, 12 changer transitions 0/163 dead transitions. [2025-01-10 01:04:13,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 163 transitions, 837 flow [2025-01-10 01:04:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:04:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:04:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 394 transitions. [2025-01-10 01:04:13,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6840277777777778 [2025-01-10 01:04:13,284 INFO L175 Difference]: Start difference. First operand has 105 places, 114 transitions, 448 flow. Second operand 6 states and 394 transitions. [2025-01-10 01:04:13,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 163 transitions, 837 flow [2025-01-10 01:04:13,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 163 transitions, 832 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:13,289 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 485 flow [2025-01-10 01:04:13,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=111, PETRI_TRANSITIONS=116} [2025-01-10 01:04:13,290 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 21 predicate places. [2025-01-10 01:04:13,290 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 485 flow [2025-01-10 01:04:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 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-01-10 01:04:13,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:13,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:04:13,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:13,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -989810689, now seen corresponding path program 1 times [2025-01-10 01:04:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:13,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963334205] [2025-01-10 01:04:13,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:13,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:13,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:13,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:13,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:04:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963334205] [2025-01-10 01:04:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963334205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:04:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965267855] [2025-01-10 01:04:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:13,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:13,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:13,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:13,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:13,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:13,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:13,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:13,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:13,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:14,006 INFO L124 PetriNetUnfolderBase]: 5778/10939 cut-off events. [2025-01-10 01:04:14,006 INFO L125 PetriNetUnfolderBase]: For 5439/5698 co-relation queries the response was YES. [2025-01-10 01:04:14,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22440 conditions, 10939 events. 5778/10939 cut-off events. For 5439/5698 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 86307 event pairs, 3566 based on Foata normal form. 134/8518 useless extension candidates. Maximal degree in co-relation 16093. Up to 5182 conditions per place. [2025-01-10 01:04:14,051 INFO L140 encePairwiseOnDemand]: 86/96 looper letters, 123 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2025-01-10 01:04:14,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 956 flow [2025-01-10 01:04:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:04:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:04:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-01-10 01:04:14,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6927083333333334 [2025-01-10 01:04:14,052 INFO L175 Difference]: Start difference. First operand has 111 places, 116 transitions, 485 flow. Second operand 6 states and 399 transitions. [2025-01-10 01:04:14,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 174 transitions, 956 flow [2025-01-10 01:04:14,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 174 transitions, 938 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:14,063 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 514 flow [2025-01-10 01:04:14,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2025-01-10 01:04:14,064 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 25 predicate places. [2025-01-10 01:04:14,064 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 514 flow [2025-01-10 01:04:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:14,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:14,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:14,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:04:14,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:14,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash -336171101, now seen corresponding path program 1 times [2025-01-10 01:04:14,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:14,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010460710] [2025-01-10 01:04:14,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:14,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:14,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:14,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:14,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:14,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010460710] [2025-01-10 01:04:14,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010460710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:14,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478515084] [2025-01-10 01:04:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:14,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:14,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:14,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:14,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 514 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:15,126 INFO L124 PetriNetUnfolderBase]: 9871/19474 cut-off events. [2025-01-10 01:04:15,126 INFO L125 PetriNetUnfolderBase]: For 11764/12009 co-relation queries the response was YES. [2025-01-10 01:04:15,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41394 conditions, 19474 events. 9871/19474 cut-off events. For 11764/12009 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 174743 event pairs, 6011 based on Foata normal form. 184/15810 useless extension candidates. Maximal degree in co-relation 29640. Up to 7746 conditions per place. [2025-01-10 01:04:15,230 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 131 selfloop transitions, 17 changer transitions 0/187 dead transitions. [2025-01-10 01:04:15,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 187 transitions, 1088 flow [2025-01-10 01:04:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2025-01-10 01:04:15,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2025-01-10 01:04:15,232 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 514 flow. Second operand 5 states and 345 transitions. [2025-01-10 01:04:15,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 187 transitions, 1088 flow [2025-01-10 01:04:15,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 187 transitions, 1075 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:15,252 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 577 flow [2025-01-10 01:04:15,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=577, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2025-01-10 01:04:15,252 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 28 predicate places. [2025-01-10 01:04:15,253 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 577 flow [2025-01-10 01:04:15,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:15,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:15,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:15,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:04:15,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash 822471491, now seen corresponding path program 1 times [2025-01-10 01:04:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538892055] [2025-01-10 01:04:15,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:15,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:15,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:15,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:15,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:04:15,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:15,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538892055] [2025-01-10 01:04:15,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538892055] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:15,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:15,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:04:15,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873396991] [2025-01-10 01:04:15,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:15,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:15,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:15,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:15,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:15,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 96 [2025-01-10 01:04:15,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 577 flow. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:15,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:15,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 96 [2025-01-10 01:04:15,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:16,727 INFO L124 PetriNetUnfolderBase]: 12156/22316 cut-off events. [2025-01-10 01:04:16,728 INFO L125 PetriNetUnfolderBase]: For 19555/20055 co-relation queries the response was YES. [2025-01-10 01:04:16,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50825 conditions, 22316 events. 12156/22316 cut-off events. For 19555/20055 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 187456 event pairs, 8474 based on Foata normal form. 0/18996 useless extension candidates. Maximal degree in co-relation 35928. Up to 16660 conditions per place. [2025-01-10 01:04:16,827 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 77 selfloop transitions, 9 changer transitions 0/118 dead transitions. [2025-01-10 01:04:16,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 118 transitions, 741 flow [2025-01-10 01:04:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:16,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2025-01-10 01:04:16,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5145833333333333 [2025-01-10 01:04:16,829 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 577 flow. Second operand 5 states and 247 transitions. [2025-01-10 01:04:16,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 118 transitions, 741 flow [2025-01-10 01:04:16,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 118 transitions, 732 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:04:16,852 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 578 flow [2025-01-10 01:04:16,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=578, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2025-01-10 01:04:16,853 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 27 predicate places. [2025-01-10 01:04:16,853 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 578 flow [2025-01-10 01:04:16,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:16,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:16,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:16,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:04:16,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:16,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:16,854 INFO L85 PathProgramCache]: Analyzing trace with hash 822471492, now seen corresponding path program 1 times [2025-01-10 01:04:16,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:16,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961091802] [2025-01-10 01:04:16,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:16,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:16,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:16,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:16,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:16,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:17,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:17,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961091802] [2025-01-10 01:04:17,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961091802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:17,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263523045] [2025-01-10 01:04:17,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:17,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:17,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:17,076 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:17,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:04:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:04:17,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:04:17,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:17,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:17,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:04:17,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:17,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:04:17,203 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:04:17,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:04:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:17,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:17,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:17,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:04:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:17,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:17,478 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 162 treesize of output 156 [2025-01-10 01:04:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:17,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263523045] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:17,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-01-10 01:04:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32989047] [2025-01-10 01:04:17,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:04:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:17,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:04:17,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:04:18,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-01-10 01:04:18,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 578 flow. Second operand has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:18,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:18,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-01-10 01:04:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:20,456 INFO L124 PetriNetUnfolderBase]: 16485/29317 cut-off events. [2025-01-10 01:04:20,459 INFO L125 PetriNetUnfolderBase]: For 23270/24262 co-relation queries the response was YES. [2025-01-10 01:04:20,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66493 conditions, 29317 events. 16485/29317 cut-off events. For 23270/24262 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 242808 event pairs, 6970 based on Foata normal form. 0/24693 useless extension candidates. Maximal degree in co-relation 47690. Up to 9096 conditions per place. [2025-01-10 01:04:20,677 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 160 selfloop transitions, 28 changer transitions 0/218 dead transitions. [2025-01-10 01:04:20,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 218 transitions, 1322 flow [2025-01-10 01:04:20,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 487 transitions. [2025-01-10 01:04:20,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636574074074074 [2025-01-10 01:04:20,679 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 578 flow. Second operand 9 states and 487 transitions. [2025-01-10 01:04:20,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 218 transitions, 1322 flow [2025-01-10 01:04:20,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 218 transitions, 1308 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:20,729 INFO L231 Difference]: Finished difference. Result has 123 places, 122 transitions, 661 flow [2025-01-10 01:04:20,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=661, PETRI_PLACES=123, PETRI_TRANSITIONS=122} [2025-01-10 01:04:20,730 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 33 predicate places. [2025-01-10 01:04:20,731 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 122 transitions, 661 flow [2025-01-10 01:04:20,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 39.0625) internal successors, (625), 16 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:20,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:20,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:20,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:20,932 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,SelfDestructingSolverStorable13 [2025-01-10 01:04:20,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:20,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:20,932 INFO L85 PathProgramCache]: Analyzing trace with hash -273186816, now seen corresponding path program 1 times [2025-01-10 01:04:20,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:20,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178966307] [2025-01-10 01:04:20,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:20,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:04:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:04:20,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:20,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178966307] [2025-01-10 01:04:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178966307] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768713496] [2025-01-10 01:04:21,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:21,265 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:21,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:04:21,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:04:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:04:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:04:21,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:21,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:04:21,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:21,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:21,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:21,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:04:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:21,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:21,608 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 52 treesize of output 48 [2025-01-10 01:04:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768713496] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:21,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:21,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:04:21,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198391997] [2025-01-10 01:04:21,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:21,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:04:21,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:21,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:04:21,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:04:22,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 96 [2025-01-10 01:04:22,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 661 flow. Second operand has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:22,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:22,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 96 [2025-01-10 01:04:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:24,756 INFO L124 PetriNetUnfolderBase]: 12786/22936 cut-off events. [2025-01-10 01:04:24,757 INFO L125 PetriNetUnfolderBase]: For 26939/27985 co-relation queries the response was YES. [2025-01-10 01:04:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55222 conditions, 22936 events. 12786/22936 cut-off events. For 26939/27985 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 188011 event pairs, 5906 based on Foata normal form. 126/20255 useless extension candidates. Maximal degree in co-relation 40138. Up to 6968 conditions per place. [2025-01-10 01:04:24,867 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 140 selfloop transitions, 30 changer transitions 0/203 dead transitions. [2025-01-10 01:04:24,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 203 transitions, 1256 flow [2025-01-10 01:04:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 536 transitions. [2025-01-10 01:04:24,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2025-01-10 01:04:24,869 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 661 flow. Second operand 9 states and 536 transitions. [2025-01-10 01:04:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 203 transitions, 1256 flow [2025-01-10 01:04:24,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 203 transitions, 1201 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-01-10 01:04:24,901 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 700 flow [2025-01-10 01:04:24,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=700, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2025-01-10 01:04:24,901 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 38 predicate places. [2025-01-10 01:04:24,901 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 700 flow [2025-01-10 01:04:24,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 46.07692307692308) internal successors, (599), 13 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:24,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:24,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:24,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:25,106 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,SelfDestructingSolverStorable14 [2025-01-10 01:04:25,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -273186817, now seen corresponding path program 1 times [2025-01-10 01:04:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684155474] [2025-01-10 01:04:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:25,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:04:25,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:04:25,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:25,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:04:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684155474] [2025-01-10 01:04:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684155474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:25,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:25,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:25,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30673496] [2025-01-10 01:04:25,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:25,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:25,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:25,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:25,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 96 [2025-01-10 01:04:25,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 700 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:25,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:25,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 96 [2025-01-10 01:04:25,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:26,387 INFO L124 PetriNetUnfolderBase]: 13885/24728 cut-off events. [2025-01-10 01:04:26,388 INFO L125 PetriNetUnfolderBase]: For 36950/37754 co-relation queries the response was YES. [2025-01-10 01:04:26,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62443 conditions, 24728 events. 13885/24728 cut-off events. For 36950/37754 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 200054 event pairs, 9395 based on Foata normal form. 362/22334 useless extension candidates. Maximal degree in co-relation 44254. Up to 18831 conditions per place. [2025-01-10 01:04:26,558 INFO L140 encePairwiseOnDemand]: 89/96 looper letters, 78 selfloop transitions, 14 changer transitions 0/120 dead transitions. [2025-01-10 01:04:26,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 120 transitions, 876 flow [2025-01-10 01:04:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-01-10 01:04:26,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5229166666666667 [2025-01-10 01:04:26,560 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 700 flow. Second operand 5 states and 251 transitions. [2025-01-10 01:04:26,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 120 transitions, 876 flow [2025-01-10 01:04:26,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 120 transitions, 820 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:04:26,596 INFO L231 Difference]: Finished difference. Result has 122 places, 120 transitions, 664 flow [2025-01-10 01:04:26,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=664, PETRI_PLACES=122, PETRI_TRANSITIONS=120} [2025-01-10 01:04:26,596 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2025-01-10 01:04:26,596 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 120 transitions, 664 flow [2025-01-10 01:04:26,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:26,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:26,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:26,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:04:26,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash -281355750, now seen corresponding path program 1 times [2025-01-10 01:04:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814943077] [2025-01-10 01:04:26,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:26,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:04:26,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:04:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:26,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814943077] [2025-01-10 01:04:26,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814943077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313038453] [2025-01-10 01:04:26,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:26,784 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:26,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:04:26,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:04:26,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:04:26,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:26,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:26,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:04:26,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:26,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:04:26,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:26,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:26,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:26,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:04:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:26,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:27,055 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 52 treesize of output 48 [2025-01-10 01:04:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:27,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313038453] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:27,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:27,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:04:27,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123172056] [2025-01-10 01:04:27,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:27,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:04:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:27,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:04:27,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:04:31,200 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-01-10 01:04:35,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-01-10 01:04:39,245 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-01-10 01:04:43,298 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-01-10 01:04:47,797 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-01-10 01:04:47,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 96 [2025-01-10 01:04:47,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 120 transitions, 664 flow. Second operand has 13 states, 13 states have (on average 40.53846153846154) internal successors, (527), 13 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:47,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:47,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 96 [2025-01-10 01:04:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:49,606 INFO L124 PetriNetUnfolderBase]: 16804/29322 cut-off events. [2025-01-10 01:04:49,606 INFO L125 PetriNetUnfolderBase]: For 45760/48075 co-relation queries the response was YES. [2025-01-10 01:04:49,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73041 conditions, 29322 events. 16804/29322 cut-off events. For 45760/48075 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 237686 event pairs, 6918 based on Foata normal form. 188/25172 useless extension candidates. Maximal degree in co-relation 51889. Up to 9139 conditions per place. [2025-01-10 01:04:49,769 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 151 selfloop transitions, 30 changer transitions 0/209 dead transitions. [2025-01-10 01:04:49,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 209 transitions, 1384 flow [2025-01-10 01:04:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:04:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:04:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 482 transitions. [2025-01-10 01:04:49,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5578703703703703 [2025-01-10 01:04:49,773 INFO L175 Difference]: Start difference. First operand has 122 places, 120 transitions, 664 flow. Second operand 9 states and 482 transitions. [2025-01-10 01:04:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 209 transitions, 1384 flow [2025-01-10 01:04:49,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 209 transitions, 1364 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:04:49,814 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 741 flow [2025-01-10 01:04:49,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=741, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2025-01-10 01:04:49,814 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 38 predicate places. [2025-01-10 01:04:49,814 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 741 flow [2025-01-10 01:04:49,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 40.53846153846154) internal successors, (527), 13 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:49,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:49,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:49,821 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-01-10 01:04:50,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 01:04:50,015 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:50,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1848944976, now seen corresponding path program 1 times [2025-01-10 01:04:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772021435] [2025-01-10 01:04:50,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:50,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:04:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:04:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:04:50,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772021435] [2025-01-10 01:04:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772021435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:04:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724697884] [2025-01-10 01:04:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:50,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:04:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:50,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:04:50,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:04:50,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:04:50,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 741 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:50,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:50,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:04:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:51,184 INFO L124 PetriNetUnfolderBase]: 13337/23796 cut-off events. [2025-01-10 01:04:51,184 INFO L125 PetriNetUnfolderBase]: For 44785/46110 co-relation queries the response was YES. [2025-01-10 01:04:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63646 conditions, 23796 events. 13337/23796 cut-off events. For 44785/46110 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 189859 event pairs, 8314 based on Foata normal form. 288/21467 useless extension candidates. Maximal degree in co-relation 46816. Up to 12387 conditions per place. [2025-01-10 01:04:51,363 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 139 selfloop transitions, 17 changer transitions 0/187 dead transitions. [2025-01-10 01:04:51,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 187 transitions, 1413 flow [2025-01-10 01:04:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:04:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:04:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 338 transitions. [2025-01-10 01:04:51,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2025-01-10 01:04:51,368 INFO L175 Difference]: Start difference. First operand has 128 places, 123 transitions, 741 flow. Second operand 5 states and 338 transitions. [2025-01-10 01:04:51,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 187 transitions, 1413 flow [2025-01-10 01:04:51,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 187 transitions, 1353 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-10 01:04:51,415 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 761 flow [2025-01-10 01:04:51,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-01-10 01:04:51,416 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 38 predicate places. [2025-01-10 01:04:51,416 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 761 flow [2025-01-10 01:04:51,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:51,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:51,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:51,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:04:51,417 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:51,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -132092929, now seen corresponding path program 1 times [2025-01-10 01:04:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:51,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502339891] [2025-01-10 01:04:51,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:51,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:51,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:04:51,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:04:51,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:51,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502339891] [2025-01-10 01:04:51,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502339891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:51,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098234146] [2025-01-10 01:04:51,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:51,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:51,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:51,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:51,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:04:51,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:04:51,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:04:51,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:51,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:51,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:04:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:51,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:51,792 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 22 treesize of output 18 [2025-01-10 01:04:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098234146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:51,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:51,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:04:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166542314] [2025-01-10 01:04:51,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:04:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:51,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:04:51,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:04:52,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:04:52,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 761 flow. Second operand has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:52,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:52,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:04:52,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:53,850 INFO L124 PetriNetUnfolderBase]: 14471/24856 cut-off events. [2025-01-10 01:04:53,850 INFO L125 PetriNetUnfolderBase]: For 47884/49595 co-relation queries the response was YES. [2025-01-10 01:04:53,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67950 conditions, 24856 events. 14471/24856 cut-off events. For 47884/49595 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 190677 event pairs, 6530 based on Foata normal form. 179/23379 useless extension candidates. Maximal degree in co-relation 50821. Up to 7714 conditions per place. [2025-01-10 01:04:54,024 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 161 selfloop transitions, 30 changer transitions 0/220 dead transitions. [2025-01-10 01:04:54,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 1615 flow [2025-01-10 01:04:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:04:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:04:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 461 transitions. [2025-01-10 01:04:54,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6860119047619048 [2025-01-10 01:04:54,026 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 761 flow. Second operand 7 states and 461 transitions. [2025-01-10 01:04:54,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 1615 flow [2025-01-10 01:04:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 220 transitions, 1593 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:04:54,077 INFO L231 Difference]: Finished difference. Result has 133 places, 127 transitions, 820 flow [2025-01-10 01:04:54,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=820, PETRI_PLACES=133, PETRI_TRANSITIONS=127} [2025-01-10 01:04:54,077 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 43 predicate places. [2025-01-10 01:04:54,077 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 127 transitions, 820 flow [2025-01-10 01:04:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.36363636363637) internal successors, (543), 11 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:54,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:54,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:54,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:04:54,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:54,279 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:54,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:54,279 INFO L85 PathProgramCache]: Analyzing trace with hash -132092930, now seen corresponding path program 1 times [2025-01-10 01:04:54,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:54,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522555011] [2025-01-10 01:04:54,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:54,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:54,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:04:54,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:04:54,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:54,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:54,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:54,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522555011] [2025-01-10 01:04:54,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522555011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:04:54,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:04:54,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:04:54,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57934938] [2025-01-10 01:04:54,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:04:54,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:04:54,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:54,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:04:54,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:04:54,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 96 [2025-01-10 01:04:54,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 127 transitions, 820 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:54,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:54,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 96 [2025-01-10 01:04:54,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:04:56,067 INFO L124 PetriNetUnfolderBase]: 14918/25250 cut-off events. [2025-01-10 01:04:56,067 INFO L125 PetriNetUnfolderBase]: For 61984/63910 co-relation queries the response was YES. [2025-01-10 01:04:56,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73803 conditions, 25250 events. 14918/25250 cut-off events. For 61984/63910 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 188345 event pairs, 10042 based on Foata normal form. 574/24647 useless extension candidates. Maximal degree in co-relation 52593. Up to 20134 conditions per place. [2025-01-10 01:04:56,258 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 89 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2025-01-10 01:04:56,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 123 transitions, 1008 flow [2025-01-10 01:04:56,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:04:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:04:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-01-10 01:04:56,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5572916666666666 [2025-01-10 01:04:56,260 INFO L175 Difference]: Start difference. First operand has 133 places, 127 transitions, 820 flow. Second operand 4 states and 214 transitions. [2025-01-10 01:04:56,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 123 transitions, 1008 flow [2025-01-10 01:04:56,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 123 transitions, 953 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 01:04:56,320 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 775 flow [2025-01-10 01:04:56,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=775, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-01-10 01:04:56,320 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 37 predicate places. [2025-01-10 01:04:56,320 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 775 flow [2025-01-10 01:04:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:04:56,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:04:56,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:04:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:04:56,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:04:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:04:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -456483994, now seen corresponding path program 1 times [2025-01-10 01:04:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:04:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773649956] [2025-01-10 01:04:56,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:04:56,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:04:56,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:04:56,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:56,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:04:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:04:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773649956] [2025-01-10 01:04:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773649956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:04:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379951211] [2025-01-10 01:04:56,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:04:56,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:04:56,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:04:56,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:04:56,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:04:56,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:04:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:04:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:04:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:04:56,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:04:56,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:04:56,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:04:56,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:56,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:56,660 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:04:56,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:04:56,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:04:56,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:04:56,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:04:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:04:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:56,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:56,904 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-01-10 01:04:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:04:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379951211] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:57,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2025-01-10 01:04:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450077034] [2025-01-10 01:04:57,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:57,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:04:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:57,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:04:57,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:05:01,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 01:05:02,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 96 [2025-01-10 01:05:02,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 775 flow. Second operand has 17 states, 17 states have (on average 39.294117647058826) internal successors, (668), 17 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:02,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:02,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 96 [2025-01-10 01:05:02,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:04,903 INFO L124 PetriNetUnfolderBase]: 23827/37924 cut-off events. [2025-01-10 01:05:04,903 INFO L125 PetriNetUnfolderBase]: For 92306/96403 co-relation queries the response was YES. [2025-01-10 01:05:05,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110348 conditions, 37924 events. 23827/37924 cut-off events. For 92306/96403 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 274121 event pairs, 9599 based on Foata normal form. 187/35898 useless extension candidates. Maximal degree in co-relation 76564. Up to 13797 conditions per place. [2025-01-10 01:05:05,146 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 188 selfloop transitions, 30 changer transitions 0/239 dead transitions. [2025-01-10 01:05:05,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 239 transitions, 1846 flow [2025-01-10 01:05:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:05:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:05:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 483 transitions. [2025-01-10 01:05:05,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2025-01-10 01:05:05,149 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 775 flow. Second operand 9 states and 483 transitions. [2025-01-10 01:05:05,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 239 transitions, 1846 flow [2025-01-10 01:05:05,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 239 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:05:05,193 INFO L231 Difference]: Finished difference. Result has 134 places, 126 transitions, 862 flow [2025-01-10 01:05:05,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=862, PETRI_PLACES=134, PETRI_TRANSITIONS=126} [2025-01-10 01:05:05,194 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 44 predicate places. [2025-01-10 01:05:05,194 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 126 transitions, 862 flow [2025-01-10 01:05:05,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 39.294117647058826) internal successors, (668), 17 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:05,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:05,194 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:05,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:05,395 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:05:05,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:05,396 INFO L85 PathProgramCache]: Analyzing trace with hash 455297194, now seen corresponding path program 1 times [2025-01-10 01:05:05,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:05,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552791338] [2025-01-10 01:05:05,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:05,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:05,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:05:05,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:05:05,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:05,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552791338] [2025-01-10 01:05:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552791338] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236137391] [2025-01-10 01:05:05,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:05,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:05,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:05,457 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:05,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:05:05,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 01:05:05,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:05:05,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:05,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:05,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:05:05,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:05,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236137391] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:05,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2025-01-10 01:05:05,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110532962] [2025-01-10 01:05:05,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:05,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:05,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:05:05,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 126 transitions, 862 flow. Second operand has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:05,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:05,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:05:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:10,361 INFO L124 PetriNetUnfolderBase]: 44787/76285 cut-off events. [2025-01-10 01:05:10,362 INFO L125 PetriNetUnfolderBase]: For 219755/226578 co-relation queries the response was YES. [2025-01-10 01:05:10,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232736 conditions, 76285 events. 44787/76285 cut-off events. For 219755/226578 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 677725 event pairs, 19894 based on Foata normal form. 1441/75224 useless extension candidates. Maximal degree in co-relation 134377. Up to 14102 conditions per place. [2025-01-10 01:05:11,200 INFO L140 encePairwiseOnDemand]: 82/96 looper letters, 419 selfloop transitions, 79 changer transitions 0/525 dead transitions. [2025-01-10 01:05:11,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 525 transitions, 4375 flow [2025-01-10 01:05:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-10 01:05:11,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-10 01:05:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1857 transitions. [2025-01-10 01:05:11,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623991935483871 [2025-01-10 01:05:11,202 INFO L175 Difference]: Start difference. First operand has 134 places, 126 transitions, 862 flow. Second operand 31 states and 1857 transitions. [2025-01-10 01:05:11,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 525 transitions, 4375 flow [2025-01-10 01:05:11,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 525 transitions, 4198 flow, removed 40 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:11,668 INFO L231 Difference]: Finished difference. Result has 169 places, 176 transitions, 1491 flow [2025-01-10 01:05:11,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1491, PETRI_PLACES=169, PETRI_TRANSITIONS=176} [2025-01-10 01:05:11,669 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 79 predicate places. [2025-01-10 01:05:11,669 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 176 transitions, 1491 flow [2025-01-10 01:05:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.25) internal successors, (820), 16 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:11,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:11,669 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:11,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:11,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:11,870 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:05:11,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:11,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1266101176, now seen corresponding path program 1 times [2025-01-10 01:05:11,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:11,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030009820] [2025-01-10 01:05:11,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:11,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:05:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:05:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:11,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:11,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030009820] [2025-01-10 01:05:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030009820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015440923] [2025-01-10 01:05:11,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:11,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:11,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:11,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:05:12,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 01:05:12,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:05:12,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:12,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 01:05:12,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:12,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:12,141 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 22 treesize of output 18 [2025-01-10 01:05:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:12,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015440923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:12,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:05:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73164522] [2025-01-10 01:05:12,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:12,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:05:12,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:12,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:05:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:05:12,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 96 [2025-01-10 01:05:12,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 176 transitions, 1491 flow. Second operand has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:12,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:12,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 96 [2025-01-10 01:05:12,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:17,814 INFO L124 PetriNetUnfolderBase]: 48539/78163 cut-off events. [2025-01-10 01:05:17,814 INFO L125 PetriNetUnfolderBase]: For 298413/310135 co-relation queries the response was YES. [2025-01-10 01:05:18,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254171 conditions, 78163 events. 48539/78163 cut-off events. For 298413/310135 co-relation queries the response was YES. Maximal size of possible extension queue 2149. Compared 649014 event pairs, 20052 based on Foata normal form. 884/76787 useless extension candidates. Maximal degree in co-relation 250407. Up to 29076 conditions per place. [2025-01-10 01:05:18,617 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 249 selfloop transitions, 45 changer transitions 0/319 dead transitions. [2025-01-10 01:05:18,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 319 transitions, 3292 flow [2025-01-10 01:05:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:05:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:05:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 459 transitions. [2025-01-10 01:05:18,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6830357142857143 [2025-01-10 01:05:18,619 INFO L175 Difference]: Start difference. First operand has 169 places, 176 transitions, 1491 flow. Second operand 7 states and 459 transitions. [2025-01-10 01:05:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 319 transitions, 3292 flow [2025-01-10 01:05:19,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 319 transitions, 3192 flow, removed 36 selfloop flow, removed 6 redundant places. [2025-01-10 01:05:19,401 INFO L231 Difference]: Finished difference. Result has 170 places, 176 transitions, 1559 flow [2025-01-10 01:05:19,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1559, PETRI_PLACES=170, PETRI_TRANSITIONS=176} [2025-01-10 01:05:19,402 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 80 predicate places. [2025-01-10 01:05:19,402 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 176 transitions, 1559 flow [2025-01-10 01:05:19,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.72727272727273) internal successors, (547), 11 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:19,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:19,402 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:19,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:05:19,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-10 01:05:19,603 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:05:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -989677151, now seen corresponding path program 1 times [2025-01-10 01:05:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:19,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999698081] [2025-01-10 01:05:19,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:19,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:05:19,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:05:19,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:19,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999698081] [2025-01-10 01:05:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999698081] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031156292] [2025-01-10 01:05:19,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:05:19,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:19,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:19,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:19,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:05:19,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:05:19,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:05:19,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:05:19,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:19,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:05:19,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:19,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:19,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031156292] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:19,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:19,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:05:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870062826] [2025-01-10 01:05:19,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:19,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 01:05:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:19,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 01:05:19,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:05:20,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 96 [2025-01-10 01:05:20,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 176 transitions, 1559 flow. Second operand has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:20,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:05:20,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 96 [2025-01-10 01:05:20,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:05:29,212 INFO L124 PetriNetUnfolderBase]: 69226/115639 cut-off events. [2025-01-10 01:05:29,213 INFO L125 PetriNetUnfolderBase]: For 487277/500111 co-relation queries the response was YES. [2025-01-10 01:05:29,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385637 conditions, 115639 events. 69226/115639 cut-off events. For 487277/500111 co-relation queries the response was YES. Maximal size of possible extension queue 3442. Compared 1064192 event pairs, 30498 based on Foata normal form. 1777/115182 useless extension candidates. Maximal degree in co-relation 368921. Up to 23153 conditions per place. [2025-01-10 01:05:30,342 INFO L140 encePairwiseOnDemand]: 83/96 looper letters, 442 selfloop transitions, 89 changer transitions 0/558 dead transitions. [2025-01-10 01:05:30,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 558 transitions, 5413 flow [2025-01-10 01:05:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:05:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-10 01:05:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1328 transitions. [2025-01-10 01:05:30,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-01-10 01:05:30,344 INFO L175 Difference]: Start difference. First operand has 170 places, 176 transitions, 1559 flow. Second operand 21 states and 1328 transitions. [2025-01-10 01:05:30,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 558 transitions, 5413 flow [2025-01-10 01:05:31,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 558 transitions, 5252 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 01:05:31,176 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 2023 flow [2025-01-10 01:05:31,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2023, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2025-01-10 01:05:31,177 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 101 predicate places. [2025-01-10 01:05:31,177 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 2023 flow [2025-01-10 01:05:31,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 51.4375) internal successors, (823), 16 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:05:31,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:05:31,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:05:31,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:05:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:05:31,379 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2025-01-10 01:05:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:05:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1136353209, now seen corresponding path program 2 times [2025-01-10 01:05:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:05:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451909180] [2025-01-10 01:05:31,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:05:31,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:05:31,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:31,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:05:31,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:05:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451909180] [2025-01-10 01:05:31,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451909180] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:05:31,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645898961] [2025-01-10 01:05:31,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:05:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:05:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:05:31,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:05:31,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:05:31,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 01:05:31,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:05:31,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:05:31,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:05:31,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-10 01:05:31,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:05:31,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:05:31,974 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:05:31,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:05:31,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:05:32,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:05:32,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 01:05:32,025 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:05:32,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:05:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:32,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:05:32,368 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 162 treesize of output 156 [2025-01-10 01:05:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:05:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645898961] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:05:32,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:05:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2025-01-10 01:05:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786415481] [2025-01-10 01:05:32,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:05:32,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:05:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:05:32,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:05:32,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650