./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.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-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:03:04,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:03:04,109 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:04,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:03:04,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:03:04,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:03:04,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:03:04,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:03:04,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:03:04,145 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:03:04,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:03:04,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:03:04,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:03:04,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:03:04,146 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:03:04,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:03:04,147 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:03:04,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:04,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:04,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:03:04,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:03:04,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:03:04,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:03:04,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:04,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:03:04,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:03:04,150 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-01-10 01:03:04,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:03:04,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:03:04,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:03:04,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:03:04,460 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:03:04,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-01-10 01:03:05,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f62b5c46/139415e4efe0479f916674af17197a01/FLAG74b67093e [2025-01-10 01:03:06,048 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:03:06,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-01-10 01:03:06,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f62b5c46/139415e4efe0479f916674af17197a01/FLAG74b67093e [2025-01-10 01:03:06,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1f62b5c46/139415e4efe0479f916674af17197a01 [2025-01-10 01:03:06,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:03:06,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:03:06,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:06,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:03:06,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:03:06,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@346ce934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06, skipping insertion in model container [2025-01-10 01:03:06,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:03:06,259 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:03:06,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:06,272 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:03:06,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:03:06,325 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:03:06,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06 WrapperNode [2025-01-10 01:03:06,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:03:06,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:06,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:03:06,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:03:06,334 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:03:06" (1/1) ... [2025-01-10 01:03:06,340 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:03:06" (1/1) ... [2025-01-10 01:03:06,372 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 401 [2025-01-10 01:03:06,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:03:06,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:03:06,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:03:06,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:03:06,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,413 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:03:06,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:03:06,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:03:06,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:03:06,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:03:06,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (1/1) ... [2025-01-10 01:03:06,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:03:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:06,488 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:03:06,496 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:03:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:03:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:03:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:03:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:03:06,519 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:03:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:03:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:03:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:03:06,521 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:03:06,649 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:03:06,651 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:03:07,242 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:03:07,246 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:03:07,645 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:03:07,646 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 01:03:07,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:07 BoogieIcfgContainer [2025-01-10 01:03:07,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:03:07,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:03:07,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:03:07,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:03:07,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:03:06" (1/3) ... [2025-01-10 01:03:07,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388596e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:07, skipping insertion in model container [2025-01-10 01:03:07,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:03:06" (2/3) ... [2025-01-10 01:03:07,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388596e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:03:07, skipping insertion in model container [2025-01-10 01:03:07,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:03:07" (3/3) ... [2025-01-10 01:03:07,654 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-01-10 01:03:07,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:03:07,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 107 locations, 1 initial locations, 4 loop locations, and 38 error locations. [2025-01-10 01:03:07,668 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:03:07,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:03:07,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 126 transitions, 266 flow [2025-01-10 01:03:07,867 INFO L124 PetriNetUnfolderBase]: 20/124 cut-off events. [2025-01-10 01:03:07,870 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:03:07,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 124 events. 20/124 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 388 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-01-10 01:03:07,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 126 transitions, 266 flow [2025-01-10 01:03:07,881 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 123 transitions, 258 flow [2025-01-10 01:03:07,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:03:07,899 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;@68be7581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:03:07,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-01-10 01:03:07,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:03:07,905 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:03:07,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:03:07,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:07,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:07,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:07,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:07,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1285605, now seen corresponding path program 1 times [2025-01-10 01:03:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668522882] [2025-01-10 01:03:07,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:07,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:07,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:07,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:07,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:08,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668522882] [2025-01-10 01:03:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668522882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:03:08,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654921376] [2025-01-10 01:03:08,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:08,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:08,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-01-10 01:03:08,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:08,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:08,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-01-10 01:03:08,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:08,798 INFO L124 PetriNetUnfolderBase]: 1446/3461 cut-off events. [2025-01-10 01:03:08,798 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 01:03:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3461 events. 1446/3461 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25177 event pairs, 790 based on Foata normal form. 1/2625 useless extension candidates. Maximal degree in co-relation 5456. Up to 2083 conditions per place. [2025-01-10 01:03:08,825 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 56 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-01-10 01:03:08,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 117 transitions, 362 flow [2025-01-10 01:03:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-01-10 01:03:08,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-01-10 01:03:08,841 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 258 flow. Second operand 3 states and 249 transitions. [2025-01-10 01:03:08,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 117 transitions, 362 flow [2025-01-10 01:03:08,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:08,850 INFO L231 Difference]: Finished difference. Result has 104 places, 117 transitions, 242 flow [2025-01-10 01:03:08,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=104, PETRI_TRANSITIONS=117} [2025-01-10 01:03:08,854 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-01-10 01:03:08,854 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 117 transitions, 242 flow [2025-01-10 01:03:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:08,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:08,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:03:08,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:03:08,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1285606, now seen corresponding path program 1 times [2025-01-10 01:03:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:08,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801961902] [2025-01-10 01:03:08,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:08,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:03:08,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:03:08,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:08,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801961902] [2025-01-10 01:03:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801961902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985218242] [2025-01-10 01:03:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:09,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:09,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:09,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-01-10 01:03:09,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:09,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:09,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-01-10 01:03:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:09,507 INFO L124 PetriNetUnfolderBase]: 1448/3467 cut-off events. [2025-01-10 01:03:09,508 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-10 01:03:09,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 3467 events. 1448/3467 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25242 event pairs, 790 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 5549. Up to 2092 conditions per place. [2025-01-10 01:03:09,527 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 61 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-01-10 01:03:09,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 388 flow [2025-01-10 01:03:09,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-01-10 01:03:09,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-01-10 01:03:09,529 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 242 flow. Second operand 3 states and 254 transitions. [2025-01-10 01:03:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 388 flow [2025-01-10 01:03:09,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:09,534 INFO L231 Difference]: Finished difference. Result has 106 places, 121 transitions, 278 flow [2025-01-10 01:03:09,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=106, PETRI_TRANSITIONS=121} [2025-01-10 01:03:09,535 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -4 predicate places. [2025-01-10 01:03:09,535 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 278 flow [2025-01-10 01:03:09,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:09,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:09,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:03:09,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:03:09,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1235508477, now seen corresponding path program 1 times [2025-01-10 01:03:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932030836] [2025-01-10 01:03:09,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:09,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:09,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:09,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:09,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:09,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932030836] [2025-01-10 01:03:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932030836] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:09,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877036253] [2025-01-10 01:03:09,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:09,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:09,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:09,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:09,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:03:09,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:03:09,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:03:09,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:09,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:03:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:09,993 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:03:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:10,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:10,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877036253] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:10,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-01-10 01:03:10,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365097350] [2025-01-10 01:03:10,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:03:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:10,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:03:10,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:03:10,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-01-10 01:03:10,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 278 flow. Second operand has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:10,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:10,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-01-10 01:03:10,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:10,729 INFO L124 PetriNetUnfolderBase]: 1454/3485 cut-off events. [2025-01-10 01:03:10,729 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:03:10,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5650 conditions, 3485 events. 1454/3485 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25391 event pairs, 790 based on Foata normal form. 0/2648 useless extension candidates. Maximal degree in co-relation 5549. Up to 2095 conditions per place. [2025-01-10 01:03:10,743 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 67 selfloop transitions, 17 changer transitions 0/141 dead transitions. [2025-01-10 01:03:10,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 516 flow [2025-01-10 01:03:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-01-10 01:03:10,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 01:03:10,746 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 278 flow. Second operand 6 states and 462 transitions. [2025-01-10 01:03:10,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 516 flow [2025-01-10 01:03:10,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 141 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:10,748 INFO L231 Difference]: Finished difference. Result has 112 places, 133 transitions, 386 flow [2025-01-10 01:03:10,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=112, PETRI_TRANSITIONS=133} [2025-01-10 01:03:10,749 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-01-10 01:03:10,749 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 386 flow [2025-01-10 01:03:10,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:10,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:10,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:10,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:03:10,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:10,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:10,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:10,954 INFO L85 PathProgramCache]: Analyzing trace with hash 583856545, now seen corresponding path program 1 times [2025-01-10 01:03:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609982251] [2025-01-10 01:03:10,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:10,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:03:10,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:03:10,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:10,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609982251] [2025-01-10 01:03:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609982251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:11,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:11,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973151469] [2025-01-10 01:03:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:11,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:11,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:11,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:11,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:11,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:11,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:11,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:11,319 INFO L124 PetriNetUnfolderBase]: 1452/3483 cut-off events. [2025-01-10 01:03:11,319 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-01-10 01:03:11,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 3483 events. 1452/3483 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25275 event pairs, 790 based on Foata normal form. 2/2650 useless extension candidates. Maximal degree in co-relation 5603. Up to 2104 conditions per place. [2025-01-10 01:03:11,339 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 67 selfloop transitions, 7 changer transitions 0/133 dead transitions. [2025-01-10 01:03:11,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 133 transitions, 528 flow [2025-01-10 01:03:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2025-01-10 01:03:11,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6772486772486772 [2025-01-10 01:03:11,341 INFO L175 Difference]: Start difference. First operand has 112 places, 133 transitions, 386 flow. Second operand 3 states and 256 transitions. [2025-01-10 01:03:11,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 133 transitions, 528 flow [2025-01-10 01:03:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 133 transitions, 503 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:11,344 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 365 flow [2025-01-10 01:03:11,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=365, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2025-01-10 01:03:11,345 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2025-01-10 01:03:11,345 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 365 flow [2025-01-10 01:03:11,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:11,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:11,345 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-01-10 01:03:11,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:03:11,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:11,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1557389250, now seen corresponding path program 2 times [2025-01-10 01:03:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307849402] [2025-01-10 01:03:11,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:11,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:03:11,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:11,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:11,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307849402] [2025-01-10 01:03:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307849402] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531548542] [2025-01-10 01:03:11,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:11,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:11,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:03:11,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:03:11,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:03:11,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:03:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:11,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:03:11,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:11,699 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:03:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:11,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:03:11,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531548542] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:11,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:11,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-01-10 01:03:11,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015675943] [2025-01-10 01:03:11,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:11,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:03:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:11,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:03:11,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:03:12,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-01-10 01:03:12,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 131 transitions, 365 flow. Second operand has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:12,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:12,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-01-10 01:03:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:13,832 INFO L124 PetriNetUnfolderBase]: 1454/3487 cut-off events. [2025-01-10 01:03:13,832 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-01-10 01:03:13,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5678 conditions, 3487 events. 1454/3487 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 25336 event pairs, 790 based on Foata normal form. 4/2656 useless extension candidates. Maximal degree in co-relation 5601. Up to 2087 conditions per place. [2025-01-10 01:03:13,855 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 61 selfloop transitions, 25 changer transitions 0/143 dead transitions. [2025-01-10 01:03:13,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 143 transitions, 562 flow [2025-01-10 01:03:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:03:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:03:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 648 transitions. [2025-01-10 01:03:13,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-01-10 01:03:13,857 INFO L175 Difference]: Start difference. First operand has 113 places, 131 transitions, 365 flow. Second operand 9 states and 648 transitions. [2025-01-10 01:03:13,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 143 transitions, 562 flow [2025-01-10 01:03:13,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 143 transitions, 508 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:13,863 INFO L231 Difference]: Finished difference. Result has 114 places, 135 transitions, 382 flow [2025-01-10 01:03:13,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=382, PETRI_PLACES=114, PETRI_TRANSITIONS=135} [2025-01-10 01:03:13,864 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-01-10 01:03:13,864 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 135 transitions, 382 flow [2025-01-10 01:03:13,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:13,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:13,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:13,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:03:14,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:14,065 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:14,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash -877280177, now seen corresponding path program 1 times [2025-01-10 01:03:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111598626] [2025-01-10 01:03:14,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:03:14,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:14,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111598626] [2025-01-10 01:03:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111598626] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:14,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042231560] [2025-01-10 01:03:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:14,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:14,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:14,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:03:14,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:03:14,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:03:14,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:14,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:14,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:03:14,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:14,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:14,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042231560] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:14,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:14,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:03:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467215265] [2025-01-10 01:03:14,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:14,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:03:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:14,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:03:14,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:03:14,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:14,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 135 transitions, 382 flow. Second operand has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 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:03:14,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:14,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:14,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:14,673 INFO L124 PetriNetUnfolderBase]: 1448/3481 cut-off events. [2025-01-10 01:03:14,674 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-10 01:03:14,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5662 conditions, 3481 events. 1448/3481 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 25287 event pairs, 790 based on Foata normal form. 6/2652 useless extension candidates. Maximal degree in co-relation 5557. Up to 2090 conditions per place. [2025-01-10 01:03:14,686 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 61 selfloop transitions, 19 changer transitions 0/137 dead transitions. [2025-01-10 01:03:14,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 538 flow [2025-01-10 01:03:14,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-01-10 01:03:14,688 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 01:03:14,688 INFO L175 Difference]: Start difference. First operand has 114 places, 135 transitions, 382 flow. Second operand 6 states and 462 transitions. [2025-01-10 01:03:14,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 538 flow [2025-01-10 01:03:14,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 501 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:14,692 INFO L231 Difference]: Finished difference. Result has 114 places, 131 transitions, 372 flow [2025-01-10 01:03:14,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=114, PETRI_TRANSITIONS=131} [2025-01-10 01:03:14,693 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-01-10 01:03:14,694 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 372 flow [2025-01-10 01:03:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 66.5) internal successors, (532), 8 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:03:14,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:14,694 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:14,701 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:03:14,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:14,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:14,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 721629785, now seen corresponding path program 2 times [2025-01-10 01:03:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961222717] [2025-01-10 01:03:14,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:14,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-10 01:03:14,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 25 statements. [2025-01-10 01:03:14,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-10 01:03:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961222717] [2025-01-10 01:03:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961222717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:15,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:03:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402379866] [2025-01-10 01:03:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:15,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:15,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:15,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-01-10 01:03:15,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:15,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:15,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-01-10 01:03:15,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:15,315 INFO L124 PetriNetUnfolderBase]: 1448/3293 cut-off events. [2025-01-10 01:03:15,315 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 01:03:15,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5488 conditions, 3293 events. 1448/3293 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22644 event pairs, 790 based on Foata normal form. 0/2645 useless extension candidates. Maximal degree in co-relation 5367. Up to 2083 conditions per place. [2025-01-10 01:03:15,327 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 69 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-01-10 01:03:15,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 123 transitions, 504 flow [2025-01-10 01:03:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-01-10 01:03:15,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 01:03:15,330 INFO L175 Difference]: Start difference. First operand has 114 places, 131 transitions, 372 flow. Second operand 5 states and 336 transitions. [2025-01-10 01:03:15,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 123 transitions, 504 flow [2025-01-10 01:03:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 123 transitions, 487 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:15,333 INFO L231 Difference]: Finished difference. Result has 107 places, 123 transitions, 349 flow [2025-01-10 01:03:15,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=107, PETRI_TRANSITIONS=123} [2025-01-10 01:03:15,334 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -3 predicate places. [2025-01-10 01:03:15,334 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 123 transitions, 349 flow [2025-01-10 01:03:15,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:15,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:15,335 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:03:15,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:15,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 721629786, now seen corresponding path program 1 times [2025-01-10 01:03:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182282121] [2025-01-10 01:03:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:15,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:03:15,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:03:15,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:03:15,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182282121] [2025-01-10 01:03:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182282121] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585979788] [2025-01-10 01:03:15,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:15,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:15,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:03:15,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 01:03:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 01:03:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:15,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:03:15,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:03:15,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:03:15,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585979788] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:15,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:15,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 01:03:15,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768675669] [2025-01-10 01:03:15,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:15,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:03:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:15,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:03:15,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:03:15,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:15,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 123 transitions, 349 flow. Second operand has 13 states, 13 states have (on average 66.38461538461539) internal successors, (863), 13 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:15,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:15,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:15,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:16,007 INFO L124 PetriNetUnfolderBase]: 1446/3291 cut-off events. [2025-01-10 01:03:16,008 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-10 01:03:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 3291 events. 1446/3291 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 22658 event pairs, 790 based on Foata normal form. 2/2646 useless extension candidates. Maximal degree in co-relation 5365. Up to 2087 conditions per place. [2025-01-10 01:03:16,017 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 62 selfloop transitions, 16 changer transitions 0/127 dead transitions. [2025-01-10 01:03:16,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 516 flow [2025-01-10 01:03:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:03:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:03:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 592 transitions. [2025-01-10 01:03:16,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-01-10 01:03:16,022 INFO L175 Difference]: Start difference. First operand has 107 places, 123 transitions, 349 flow. Second operand 8 states and 592 transitions. [2025-01-10 01:03:16,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 516 flow [2025-01-10 01:03:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 127 transitions, 511 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:16,024 INFO L231 Difference]: Finished difference. Result has 111 places, 121 transitions, 363 flow [2025-01-10 01:03:16,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=363, PETRI_PLACES=111, PETRI_TRANSITIONS=121} [2025-01-10 01:03:16,025 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 1 predicate places. [2025-01-10 01:03:16,025 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 121 transitions, 363 flow [2025-01-10 01:03:16,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.38461538461539) internal successors, (863), 13 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:16,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:16,026 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:16,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:03:16,230 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,SelfDestructingSolverStorable7 [2025-01-10 01:03:16,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:16,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash 137472264, now seen corresponding path program 2 times [2025-01-10 01:03:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:16,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252598757] [2025-01-10 01:03:16,231 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:16,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-10 01:03:16,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 29 statements. [2025-01-10 01:03:16,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:16,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252598757] [2025-01-10 01:03:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252598757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654435093] [2025-01-10 01:03:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:16,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:16,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:16,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:16,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 126 [2025-01-10 01:03:16,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 121 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:16,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:16,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 126 [2025-01-10 01:03:16,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:17,044 INFO L124 PetriNetUnfolderBase]: 3171/6440 cut-off events. [2025-01-10 01:03:17,044 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-10 01:03:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11199 conditions, 6440 events. 3171/6440 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 43191 event pairs, 1228 based on Foata normal form. 0/5142 useless extension candidates. Maximal degree in co-relation 11079. Up to 2560 conditions per place. [2025-01-10 01:03:17,061 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 118 selfloop transitions, 5 changer transitions 0/168 dead transitions. [2025-01-10 01:03:17,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 168 transitions, 706 flow [2025-01-10 01:03:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:17,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 461 transitions. [2025-01-10 01:03:17,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097883597883598 [2025-01-10 01:03:17,063 INFO L175 Difference]: Start difference. First operand has 111 places, 121 transitions, 363 flow. Second operand 6 states and 461 transitions. [2025-01-10 01:03:17,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 168 transitions, 706 flow [2025-01-10 01:03:17,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 168 transitions, 674 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:17,065 INFO L231 Difference]: Finished difference. Result has 110 places, 122 transitions, 355 flow [2025-01-10 01:03:17,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=110, PETRI_TRANSITIONS=122} [2025-01-10 01:03:17,066 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-01-10 01:03:17,066 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 122 transitions, 355 flow [2025-01-10 01:03:17,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:17,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:17,066 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:17,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:03:17,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:17,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 816489927, now seen corresponding path program 1 times [2025-01-10 01:03:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577159467] [2025-01-10 01:03:17,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:17,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:03:17,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:03:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:03:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577159467] [2025-01-10 01:03:17,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577159467] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:17,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885994860] [2025-01-10 01:03:17,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:17,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:17,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:17,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:17,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:03:17,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:03:17,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:03:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:17,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:03:17,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:17,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:17,675 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 20 treesize of output 16 [2025-01-10 01:03:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:17,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885994860] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:17,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:17,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-01-10 01:03:17,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367532137] [2025-01-10 01:03:17,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:17,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:03:17,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:17,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:03:17,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:03:18,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:18,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 122 transitions, 355 flow. Second operand has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:18,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:18,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:18,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:20,071 INFO L124 PetriNetUnfolderBase]: 6337/12780 cut-off events. [2025-01-10 01:03:20,072 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2025-01-10 01:03:20,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22723 conditions, 12780 events. 6337/12780 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 93745 event pairs, 1161 based on Foata normal form. 0/11150 useless extension candidates. Maximal degree in co-relation 22616. Up to 3752 conditions per place. [2025-01-10 01:03:20,123 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 144 selfloop transitions, 15 changer transitions 0/204 dead transitions. [2025-01-10 01:03:20,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 204 transitions, 869 flow [2025-01-10 01:03:20,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2025-01-10 01:03:20,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 01:03:20,127 INFO L175 Difference]: Start difference. First operand has 110 places, 122 transitions, 355 flow. Second operand 10 states and 760 transitions. [2025-01-10 01:03:20,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 204 transitions, 869 flow [2025-01-10 01:03:20,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 204 transitions, 857 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:03:20,130 INFO L231 Difference]: Finished difference. Result has 115 places, 121 transitions, 390 flow [2025-01-10 01:03:20,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=390, PETRI_PLACES=115, PETRI_TRANSITIONS=121} [2025-01-10 01:03:20,132 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 5 predicate places. [2025-01-10 01:03:20,132 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 121 transitions, 390 flow [2025-01-10 01:03:20,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:20,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:20,133 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:20,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:03:20,333 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,SelfDestructingSolverStorable9 [2025-01-10 01:03:20,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:20,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash 816489926, now seen corresponding path program 1 times [2025-01-10 01:03:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:20,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463282942] [2025-01-10 01:03:20,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:20,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:03:20,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:03:20,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:20,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:03:20,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:20,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463282942] [2025-01-10 01:03:20,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463282942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:20,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:20,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159913580] [2025-01-10 01:03:20,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:20,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:20,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:20,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:20,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-01-10 01:03:20,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 121 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:20,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:20,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-01-10 01:03:20,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:21,347 INFO L124 PetriNetUnfolderBase]: 6201/11906 cut-off events. [2025-01-10 01:03:21,348 INFO L125 PetriNetUnfolderBase]: For 1283/1303 co-relation queries the response was YES. [2025-01-10 01:03:21,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22510 conditions, 11906 events. 6201/11906 cut-off events. For 1283/1303 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 81858 event pairs, 3811 based on Foata normal form. 224/10730 useless extension candidates. Maximal degree in co-relation 22392. Up to 9068 conditions per place. [2025-01-10 01:03:21,411 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 73 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 01:03:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 524 flow [2025-01-10 01:03:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-01-10 01:03:21,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-01-10 01:03:21,412 INFO L175 Difference]: Start difference. First operand has 115 places, 121 transitions, 390 flow. Second operand 4 states and 282 transitions. [2025-01-10 01:03:21,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 113 transitions, 524 flow [2025-01-10 01:03:21,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 113 transitions, 503 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:03:21,416 INFO L231 Difference]: Finished difference. Result has 104 places, 113 transitions, 357 flow [2025-01-10 01:03:21,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=104, PETRI_TRANSITIONS=113} [2025-01-10 01:03:21,417 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-01-10 01:03:21,417 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 113 transitions, 357 flow [2025-01-10 01:03:21,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:21,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:21,417 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:03:21,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:21,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1033095956, now seen corresponding path program 1 times [2025-01-10 01:03:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742874063] [2025-01-10 01:03:21,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:21,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:21,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:03:21,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:03:21,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:21,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:03:21,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:21,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742874063] [2025-01-10 01:03:21,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742874063] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:21,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883113817] [2025-01-10 01:03:21,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:21,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:21,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:21,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:21,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:03:21,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:03:21,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:03:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:21,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:03:21,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:22,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:22,071 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 20 treesize of output 16 [2025-01-10 01:03:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883113817] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:03:22,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:03:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-01-10 01:03:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474868271] [2025-01-10 01:03:22,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:03:22,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:03:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:22,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:03:22,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:03:23,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:23,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 113 transitions, 357 flow. Second operand has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:23,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:23,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:23,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:24,810 INFO L124 PetriNetUnfolderBase]: 9460/18103 cut-off events. [2025-01-10 01:03:24,810 INFO L125 PetriNetUnfolderBase]: For 2177/2255 co-relation queries the response was YES. [2025-01-10 01:03:24,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34549 conditions, 18103 events. 9460/18103 cut-off events. For 2177/2255 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 129730 event pairs, 2682 based on Foata normal form. 0/15485 useless extension candidates. Maximal degree in co-relation 34440. Up to 5035 conditions per place. [2025-01-10 01:03:24,889 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 164 selfloop transitions, 18 changer transitions 0/216 dead transitions. [2025-01-10 01:03:24,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 216 transitions, 983 flow [2025-01-10 01:03:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:03:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:03:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 780 transitions. [2025-01-10 01:03:24,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-01-10 01:03:24,894 INFO L175 Difference]: Start difference. First operand has 104 places, 113 transitions, 357 flow. Second operand 10 states and 780 transitions. [2025-01-10 01:03:24,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 216 transitions, 983 flow [2025-01-10 01:03:24,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 216 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:24,901 INFO L231 Difference]: Finished difference. Result has 114 places, 118 transitions, 443 flow [2025-01-10 01:03:24,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=443, PETRI_PLACES=114, PETRI_TRANSITIONS=118} [2025-01-10 01:03:24,903 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-01-10 01:03:24,904 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 118 transitions, 443 flow [2025-01-10 01:03:24,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:24,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:24,905 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:24,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:03:25,109 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,SelfDestructingSolverStorable11 [2025-01-10 01:03:25,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:25,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:25,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1332149173, now seen corresponding path program 1 times [2025-01-10 01:03:25,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:25,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925684465] [2025-01-10 01:03:25,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:25,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:03:25,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:03:25,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:25,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:03:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925684465] [2025-01-10 01:03:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925684465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940308946] [2025-01-10 01:03:25,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:25,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:25,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:25,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:03:25,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:03:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:03:25,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:25,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:25,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-10 01:03:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:25,542 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:03:25,672 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-10 01:03:25,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-10 01:03:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:03:26,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:03:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940308946] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:26,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:03:26,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 12] total 25 [2025-01-10 01:03:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165044869] [2025-01-10 01:03:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:26,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:03:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:26,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:03:26,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:03:26,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:26,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 118 transitions, 443 flow. Second operand has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:26,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:26,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:26,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:28,349 INFO L124 PetriNetUnfolderBase]: 11439/20901 cut-off events. [2025-01-10 01:03:28,350 INFO L125 PetriNetUnfolderBase]: For 6440/6810 co-relation queries the response was YES. [2025-01-10 01:03:28,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42476 conditions, 20901 events. 11439/20901 cut-off events. For 6440/6810 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 148107 event pairs, 4244 based on Foata normal form. 0/17845 useless extension candidates. Maximal degree in co-relation 42355. Up to 8345 conditions per place. [2025-01-10 01:03:28,439 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 125 selfloop transitions, 10 changer transitions 0/169 dead transitions. [2025-01-10 01:03:28,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 169 transitions, 869 flow [2025-01-10 01:03:28,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:28,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2025-01-10 01:03:28,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-01-10 01:03:28,441 INFO L175 Difference]: Start difference. First operand has 114 places, 118 transitions, 443 flow. Second operand 6 states and 471 transitions. [2025-01-10 01:03:28,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 169 transitions, 869 flow [2025-01-10 01:03:28,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 169 transitions, 844 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:03:28,452 INFO L231 Difference]: Finished difference. Result has 114 places, 123 transitions, 487 flow [2025-01-10 01:03:28,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=114, PETRI_TRANSITIONS=123} [2025-01-10 01:03:28,453 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-01-10 01:03:28,453 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 123 transitions, 487 flow [2025-01-10 01:03:28,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:28,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:28,454 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:28,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:28,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:28,654 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:28,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:28,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1762731809, now seen corresponding path program 1 times [2025-01-10 01:03:28,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:28,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492591558] [2025-01-10 01:03:28,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:28,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:03:28,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:03:28,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:28,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:29,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:29,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492591558] [2025-01-10 01:03:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492591558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:29,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:03:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206229128] [2025-01-10 01:03:29,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:29,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:29,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:29,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 123 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:29,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:29,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:29,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:31,433 INFO L124 PetriNetUnfolderBase]: 11074/20733 cut-off events. [2025-01-10 01:03:31,433 INFO L125 PetriNetUnfolderBase]: For 10641/11003 co-relation queries the response was YES. [2025-01-10 01:03:31,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44806 conditions, 20733 events. 11074/20733 cut-off events. For 10641/11003 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 149756 event pairs, 6581 based on Foata normal form. 1/18208 useless extension candidates. Maximal degree in co-relation 44691. Up to 15449 conditions per place. [2025-01-10 01:03:31,545 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 119 selfloop transitions, 1 changer transitions 6/164 dead transitions. [2025-01-10 01:03:31,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 164 transitions, 886 flow [2025-01-10 01:03:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-01-10 01:03:31,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6924603174603174 [2025-01-10 01:03:31,547 INFO L175 Difference]: Start difference. First operand has 114 places, 123 transitions, 487 flow. Second operand 4 states and 349 transitions. [2025-01-10 01:03:31,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 164 transitions, 886 flow [2025-01-10 01:03:31,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 164 transitions, 881 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:31,556 INFO L231 Difference]: Finished difference. Result has 116 places, 123 transitions, 489 flow [2025-01-10 01:03:31,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=489, PETRI_PLACES=116, PETRI_TRANSITIONS=123} [2025-01-10 01:03:31,557 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 6 predicate places. [2025-01-10 01:03:31,557 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 489 flow [2025-01-10 01:03:31,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:31,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:31,557 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:31,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:03:31,558 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:31,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 696354545, now seen corresponding path program 2 times [2025-01-10 01:03:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:31,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280021633] [2025-01-10 01:03:31,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:31,569 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:03:31,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-01-10 01:03:31,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:31,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280021633] [2025-01-10 01:03:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280021633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:32,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:32,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:03:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761544720] [2025-01-10 01:03:32,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:32,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:03:32,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:32,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:03:32,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:03:32,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:32,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 123 transitions, 489 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:32,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:32,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:32,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:33,512 INFO L124 PetriNetUnfolderBase]: 11359/21248 cut-off events. [2025-01-10 01:03:33,512 INFO L125 PetriNetUnfolderBase]: For 11114/11488 co-relation queries the response was YES. [2025-01-10 01:03:33,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46094 conditions, 21248 events. 11359/21248 cut-off events. For 11114/11488 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 153493 event pairs, 6940 based on Foata normal form. 1/18696 useless extension candidates. Maximal degree in co-relation 46018. Up to 16066 conditions per place. [2025-01-10 01:03:33,653 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 116 selfloop transitions, 1 changer transitions 6/161 dead transitions. [2025-01-10 01:03:33,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 161 transitions, 864 flow [2025-01-10 01:03:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:03:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:03:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-01-10 01:03:33,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2025-01-10 01:03:33,655 INFO L175 Difference]: Start difference. First operand has 116 places, 123 transitions, 489 flow. Second operand 4 states and 347 transitions. [2025-01-10 01:03:33,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 161 transitions, 864 flow [2025-01-10 01:03:33,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 161 transitions, 858 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:33,665 INFO L231 Difference]: Finished difference. Result has 118 places, 123 transitions, 493 flow [2025-01-10 01:03:33,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=493, PETRI_PLACES=118, PETRI_TRANSITIONS=123} [2025-01-10 01:03:33,666 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 8 predicate places. [2025-01-10 01:03:33,666 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 123 transitions, 493 flow [2025-01-10 01:03:33,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:33,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:33,666 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:33,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:03:33,667 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:33,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 380577230, now seen corresponding path program 1 times [2025-01-10 01:03:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891929763] [2025-01-10 01:03:33,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:33,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-10 01:03:33,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-10 01:03:33,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:33,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:33,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891929763] [2025-01-10 01:03:33,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891929763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:33,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:33,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:33,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267487602] [2025-01-10 01:03:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:33,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:33,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:33,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:33,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 123 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:33,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:33,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:35,063 INFO L124 PetriNetUnfolderBase]: 11143/21152 cut-off events. [2025-01-10 01:03:35,063 INFO L125 PetriNetUnfolderBase]: For 11534/11908 co-relation queries the response was YES. [2025-01-10 01:03:35,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45608 conditions, 21152 events. 11143/21152 cut-off events. For 11534/11908 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 154977 event pairs, 4027 based on Foata normal form. 159/18693 useless extension candidates. Maximal degree in co-relation 45531. Up to 16330 conditions per place. [2025-01-10 01:03:35,178 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 93 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2025-01-10 01:03:35,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 718 flow [2025-01-10 01:03:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-01-10 01:03:35,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-01-10 01:03:35,179 INFO L175 Difference]: Start difference. First operand has 118 places, 123 transitions, 493 flow. Second operand 3 states and 262 transitions. [2025-01-10 01:03:35,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 718 flow [2025-01-10 01:03:35,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 133 transitions, 715 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:35,189 INFO L231 Difference]: Finished difference. Result has 119 places, 125 transitions, 523 flow [2025-01-10 01:03:35,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=119, PETRI_TRANSITIONS=125} [2025-01-10 01:03:35,190 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 9 predicate places. [2025-01-10 01:03:35,190 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 523 flow [2025-01-10 01:03:35,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:35,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:35,190 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:35,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:03:35,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:35,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash -44781506, now seen corresponding path program 2 times [2025-01-10 01:03:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634559165] [2025-01-10 01:03:35,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:03:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:35,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-01-10 01:03:35,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 40 statements. [2025-01-10 01:03:35,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:03:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:35,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:35,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634559165] [2025-01-10 01:03:35,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634559165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:35,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:35,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136696303] [2025-01-10 01:03:35,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:35,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:35,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:35,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:35,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:35,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 523 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:35,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:35,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:36,582 INFO L124 PetriNetUnfolderBase]: 10623/19870 cut-off events. [2025-01-10 01:03:36,583 INFO L125 PetriNetUnfolderBase]: For 11274/11648 co-relation queries the response was YES. [2025-01-10 01:03:36,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43243 conditions, 19870 events. 10623/19870 cut-off events. For 11274/11648 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 142394 event pairs, 6556 based on Foata normal form. 9/17445 useless extension candidates. Maximal degree in co-relation 43127. Up to 15488 conditions per place. [2025-01-10 01:03:36,683 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 85 selfloop transitions, 0 changer transitions 10/133 dead transitions. [2025-01-10 01:03:36,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 731 flow [2025-01-10 01:03:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-01-10 01:03:36,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6878306878306878 [2025-01-10 01:03:36,684 INFO L175 Difference]: Start difference. First operand has 119 places, 125 transitions, 523 flow. Second operand 3 states and 260 transitions. [2025-01-10 01:03:36,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 731 flow [2025-01-10 01:03:36,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 133 transitions, 729 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:36,695 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 509 flow [2025-01-10 01:03:36,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-01-10 01:03:36,696 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2025-01-10 01:03:36,696 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 509 flow [2025-01-10 01:03:36,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:36,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:36,696 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:36,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:03:36,696 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:36,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1168432778, now seen corresponding path program 1 times [2025-01-10 01:03:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454262269] [2025-01-10 01:03:36,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:36,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 01:03:36,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 01:03:36,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:36,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:36,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454262269] [2025-01-10 01:03:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454262269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:36,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:36,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:03:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494543278] [2025-01-10 01:03:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:36,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:03:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:36,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:03:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:03:36,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-01-10 01:03:36,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:36,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:36,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-01-10 01:03:36,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:38,084 INFO L124 PetriNetUnfolderBase]: 10272/20035 cut-off events. [2025-01-10 01:03:38,084 INFO L125 PetriNetUnfolderBase]: For 11692/12038 co-relation queries the response was YES. [2025-01-10 01:03:38,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43768 conditions, 20035 events. 10272/20035 cut-off events. For 11692/12038 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 150552 event pairs, 5912 based on Foata normal form. 84/17666 useless extension candidates. Maximal degree in co-relation 43750. Up to 12724 conditions per place. [2025-01-10 01:03:38,174 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 122 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-01-10 01:03:38,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 163 transitions, 906 flow [2025-01-10 01:03:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:03:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:03:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-01-10 01:03:38,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-01-10 01:03:38,175 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 509 flow. Second operand 3 states and 282 transitions. [2025-01-10 01:03:38,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 163 transitions, 906 flow [2025-01-10 01:03:38,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 163 transitions, 902 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:38,193 INFO L231 Difference]: Finished difference. Result has 120 places, 124 transitions, 520 flow [2025-01-10 01:03:38,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=120, PETRI_TRANSITIONS=124} [2025-01-10 01:03:38,193 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 10 predicate places. [2025-01-10 01:03:38,193 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 520 flow [2025-01-10 01:03:38,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:38,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:38,194 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:38,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:03:38,194 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:38,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1223335093, now seen corresponding path program 1 times [2025-01-10 01:03:38,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:38,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54798043] [2025-01-10 01:03:38,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:38,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:03:38,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:03:38,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:38,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54798043] [2025-01-10 01:03:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54798043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:03:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270160185] [2025-01-10 01:03:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:38,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:38,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:38,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:03:38,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:38,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:38,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:38,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:38,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:40,762 INFO L124 PetriNetUnfolderBase]: 15145/26766 cut-off events. [2025-01-10 01:03:40,762 INFO L125 PetriNetUnfolderBase]: For 16371/17033 co-relation queries the response was YES. [2025-01-10 01:03:40,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61699 conditions, 26766 events. 15145/26766 cut-off events. For 16371/17033 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 193749 event pairs, 6573 based on Foata normal form. 0/24109 useless extension candidates. Maximal degree in co-relation 61680. Up to 14599 conditions per place. [2025-01-10 01:03:40,893 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 216 selfloop transitions, 8 changer transitions 0/257 dead transitions. [2025-01-10 01:03:40,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 257 transitions, 1493 flow [2025-01-10 01:03:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:03:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:03:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-01-10 01:03:40,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-01-10 01:03:40,896 INFO L175 Difference]: Start difference. First operand has 120 places, 124 transitions, 520 flow. Second operand 6 states and 528 transitions. [2025-01-10 01:03:40,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 257 transitions, 1493 flow [2025-01-10 01:03:40,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 257 transitions, 1488 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:40,914 INFO L231 Difference]: Finished difference. Result has 126 places, 125 transitions, 555 flow [2025-01-10 01:03:40,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=126, PETRI_TRANSITIONS=125} [2025-01-10 01:03:40,914 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 16 predicate places. [2025-01-10 01:03:40,914 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 125 transitions, 555 flow [2025-01-10 01:03:40,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:40,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:40,915 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:40,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:03:40,915 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1958580782, now seen corresponding path program 1 times [2025-01-10 01:03:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:40,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478577725] [2025-01-10 01:03:40,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:40,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 01:03:40,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 01:03:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:41,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478577725] [2025-01-10 01:03:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478577725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:41,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213697865] [2025-01-10 01:03:41,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:41,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:41,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:41,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:41,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:41,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:41,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:41,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:41,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:43,809 INFO L124 PetriNetUnfolderBase]: 15034/26559 cut-off events. [2025-01-10 01:03:43,810 INFO L125 PetriNetUnfolderBase]: For 19607/20175 co-relation queries the response was YES. [2025-01-10 01:03:43,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64383 conditions, 26559 events. 15034/26559 cut-off events. For 19607/20175 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 190273 event pairs, 6305 based on Foata normal form. 220/24936 useless extension candidates. Maximal degree in co-relation 64361. Up to 12042 conditions per place. [2025-01-10 01:03:43,959 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 176 selfloop transitions, 12 changer transitions 0/221 dead transitions. [2025-01-10 01:03:43,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 221 transitions, 1314 flow [2025-01-10 01:03:43,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-01-10 01:03:43,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-01-10 01:03:43,963 INFO L175 Difference]: Start difference. First operand has 126 places, 125 transitions, 555 flow. Second operand 5 states and 438 transitions. [2025-01-10 01:03:43,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 221 transitions, 1314 flow [2025-01-10 01:03:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 221 transitions, 1307 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:44,004 INFO L231 Difference]: Finished difference. Result has 130 places, 126 transitions, 591 flow [2025-01-10 01:03:44,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=130, PETRI_TRANSITIONS=126} [2025-01-10 01:03:44,005 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 20 predicate places. [2025-01-10 01:03:44,005 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 126 transitions, 591 flow [2025-01-10 01:03:44,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:44,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:44,005 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:44,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:03:44,006 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:44,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash -614646931, now seen corresponding path program 1 times [2025-01-10 01:03:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:44,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550499778] [2025-01-10 01:03:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:44,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:44,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:03:44,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:03:44,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:44,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550499778] [2025-01-10 01:03:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550499778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:03:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447300675] [2025-01-10 01:03:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:44,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:44,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:44,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:03:44,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 126 [2025-01-10 01:03:44,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 126 transitions, 591 flow. Second operand has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:44,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:44,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 126 [2025-01-10 01:03:44,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:48,139 INFO L124 PetriNetUnfolderBase]: 21539/36776 cut-off events. [2025-01-10 01:03:48,140 INFO L125 PetriNetUnfolderBase]: For 36299/37399 co-relation queries the response was YES. [2025-01-10 01:03:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94770 conditions, 36776 events. 21539/36776 cut-off events. For 36299/37399 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 269223 event pairs, 10259 based on Foata normal form. 330/34947 useless extension candidates. Maximal degree in co-relation 94747. Up to 21121 conditions per place. [2025-01-10 01:03:48,289 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 256 selfloop transitions, 9 changer transitions 0/296 dead transitions. [2025-01-10 01:03:48,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 296 transitions, 1819 flow [2025-01-10 01:03:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:48,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2025-01-10 01:03:48,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6848072562358276 [2025-01-10 01:03:48,294 INFO L175 Difference]: Start difference. First operand has 130 places, 126 transitions, 591 flow. Second operand 7 states and 604 transitions. [2025-01-10 01:03:48,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 296 transitions, 1819 flow [2025-01-10 01:03:48,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 296 transitions, 1800 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-10 01:03:48,403 INFO L231 Difference]: Finished difference. Result has 137 places, 130 transitions, 632 flow [2025-01-10 01:03:48,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=632, PETRI_PLACES=137, PETRI_TRANSITIONS=130} [2025-01-10 01:03:48,403 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 27 predicate places. [2025-01-10 01:03:48,403 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 632 flow [2025-01-10 01:03:48,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:48,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:48,404 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:48,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:03:48,404 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1946426416, now seen corresponding path program 1 times [2025-01-10 01:03:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724149228] [2025-01-10 01:03:48,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:48,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 01:03:48,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 01:03:48,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:48,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724149228] [2025-01-10 01:03:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724149228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:48,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:03:48,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:03:48,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148078311] [2025-01-10 01:03:48,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:03:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:03:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:03:48,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-01-10 01:03:48,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 130 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:48,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:48,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-01-10 01:03:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:51,940 INFO L124 PetriNetUnfolderBase]: 18935/34057 cut-off events. [2025-01-10 01:03:51,941 INFO L125 PetriNetUnfolderBase]: For 40451/41390 co-relation queries the response was YES. [2025-01-10 01:03:52,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89405 conditions, 34057 events. 18935/34057 cut-off events. For 40451/41390 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 259295 event pairs, 9341 based on Foata normal form. 479/32597 useless extension candidates. Maximal degree in co-relation 89379. Up to 17477 conditions per place. [2025-01-10 01:03:52,138 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 181 selfloop transitions, 10 changer transitions 0/225 dead transitions. [2025-01-10 01:03:52,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 225 transitions, 1393 flow [2025-01-10 01:03:52,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:03:52,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:03:52,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-01-10 01:03:52,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-01-10 01:03:52,144 INFO L175 Difference]: Start difference. First operand has 137 places, 130 transitions, 632 flow. Second operand 5 states and 438 transitions. [2025-01-10 01:03:52,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 225 transitions, 1393 flow [2025-01-10 01:03:52,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 225 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:03:52,218 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 652 flow [2025-01-10 01:03:52,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=652, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2025-01-10 01:03:52,219 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 31 predicate places. [2025-01-10 01:03:52,219 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 652 flow [2025-01-10 01:03:52,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:52,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:52,219 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:52,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:03:52,219 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -51368242, now seen corresponding path program 1 times [2025-01-10 01:03:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487160125] [2025-01-10 01:03:52,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:52,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:03:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:03:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:52,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:03:52,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487160125] [2025-01-10 01:03:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487160125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:52,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169528577] [2025-01-10 01:03:52,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:52,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:52,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:52,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:52,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 01:03:52,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:03:52,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:03:52,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:52,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:52,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:03:52,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:03:52,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:03:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169528577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:03:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:03:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-01-10 01:03:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422735738] [2025-01-10 01:03:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:03:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:03:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:03:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:03:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:03:52,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-01-10 01:03:52,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 652 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:52,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:03:52,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-01-10 01:03:52,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:03:57,645 INFO L124 PetriNetUnfolderBase]: 25563/48358 cut-off events. [2025-01-10 01:03:57,646 INFO L125 PetriNetUnfolderBase]: For 74022/75330 co-relation queries the response was YES. [2025-01-10 01:03:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128312 conditions, 48358 events. 25563/48358 cut-off events. For 74022/75330 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 407470 event pairs, 13041 based on Foata normal form. 486/45773 useless extension candidates. Maximal degree in co-relation 128284. Up to 25623 conditions per place. [2025-01-10 01:03:57,988 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 285 selfloop transitions, 6 changer transitions 0/326 dead transitions. [2025-01-10 01:03:57,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 326 transitions, 2430 flow [2025-01-10 01:03:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:03:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:03:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2025-01-10 01:03:57,990 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-01-10 01:03:57,990 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 652 flow. Second operand 7 states and 616 transitions. [2025-01-10 01:03:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 326 transitions, 2430 flow [2025-01-10 01:03:58,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 326 transitions, 2381 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-01-10 01:03:58,117 INFO L231 Difference]: Finished difference. Result has 149 places, 133 transitions, 678 flow [2025-01-10 01:03:58,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=678, PETRI_PLACES=149, PETRI_TRANSITIONS=133} [2025-01-10 01:03:58,118 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 39 predicate places. [2025-01-10 01:03:58,118 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 133 transitions, 678 flow [2025-01-10 01:03:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:03:58,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:03:58,118 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:03:58,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 01:03:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:58,322 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-01-10 01:03:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:03:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2030444145, now seen corresponding path program 1 times [2025-01-10 01:03:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:03:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368606431] [2025-01-10 01:03:58,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:03:58,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:03:58,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:03:58,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:58,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-10 01:03:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:03:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368606431] [2025-01-10 01:03:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368606431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:03:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092754757] [2025-01-10 01:03:58,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:03:58,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:03:58,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:03:58,775 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:03:58,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:03:58,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:03:58,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:03:58,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:03:58,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:03:58,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:03:58,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:03:58,921 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:03:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:03:59,291 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-10 01:03:59,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-10 01:03:59,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:03:59,316 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:03:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:03:59,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:04:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:04:00,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092754757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:04:00,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:04:00,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2025-01-10 01:04:00,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913165933] [2025-01-10 01:04:00,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:04:00,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-10 01:04:00,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:04:00,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-10 01:04:00,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-01-10 01:04:02,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 126 [2025-01-10 01:04:02,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 133 transitions, 678 flow. Second operand has 27 states, 27 states have (on average 61.666666666666664) internal successors, (1665), 27 states have internal predecessors, (1665), 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,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:04:02,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 126 [2025-01-10 01:04:02,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand