./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:10:35,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:10:35,737 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:10:35,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:10:35,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:10:35,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:10:35,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:10:35,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:10:35,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:10:35,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:10:35,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:10:35,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:10:35,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:10:35,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:10:35,755 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:10:35,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:10:35,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:10:35,756 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:10:35,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:35,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:35,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:35,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:10:35,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:10:35,758 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-01-10 01:10:35,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:10:35,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:10:35,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:10:35,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:10:35,995 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:10:35,997 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-01-10 01:10:37,184 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de3c89e61/3f8824d77baf4ec2b4c031440b7ecaaf/FLAG0a91e465e [2025-01-10 01:10:37,525 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:10:37,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-01-10 01:10:37,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de3c89e61/3f8824d77baf4ec2b4c031440b7ecaaf/FLAG0a91e465e [2025-01-10 01:10:37,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de3c89e61/3f8824d77baf4ec2b4c031440b7ecaaf [2025-01-10 01:10:37,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:10:37,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:10:37,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:37,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:10:37,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:10:37,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fa2f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37, skipping insertion in model container [2025-01-10 01:10:37,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:10:37,756 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:10:37,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:37,771 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:10:37,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:37,806 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:10:37,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37 WrapperNode [2025-01-10 01:10:37,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:37,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:37,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:10:37,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:10:37,813 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:10:37" (1/1) ... [2025-01-10 01:10:37,825 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:10:37" (1/1) ... [2025-01-10 01:10:37,839 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-01-10 01:10:37,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:37,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:10:37,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:10:37,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:10:37,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,860 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:10:37,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:10:37,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:10:37,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:10:37,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:10:37,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (1/1) ... [2025-01-10 01:10:37,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:37,895 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:10:37,897 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:10:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:10:37,912 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:10:37,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:10:37,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:10:37,913 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:10:37,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:10:37,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:10:37,914 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:10:37,976 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:10:37,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:10:38,209 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:10:38,210 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:10:38,359 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:10:38,359 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:10:38,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:38 BoogieIcfgContainer [2025-01-10 01:10:38,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:10:38,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:10:38,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:10:38,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:10:38,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:10:37" (1/3) ... [2025-01-10 01:10:38,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3172d3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:38, skipping insertion in model container [2025-01-10 01:10:38,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:37" (2/3) ... [2025-01-10 01:10:38,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3172d3b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:38, skipping insertion in model container [2025-01-10 01:10:38,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:38" (3/3) ... [2025-01-10 01:10:38,368 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-01-10 01:10:38,379 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:10:38,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-01-10 01:10:38,380 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:10:38,448 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:10:38,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2025-01-10 01:10:38,516 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2025-01-10 01:10:38,522 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:10:38,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 7/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 147 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-01-10 01:10:38,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2025-01-10 01:10:38,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 55 transitions, 128 flow [2025-01-10 01:10:38,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:10:38,551 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;@2ca90efa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:10:38,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-10 01:10:38,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:10:38,557 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:10:38,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:38,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:38,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:38,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 434403, now seen corresponding path program 1 times [2025-01-10 01:10:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806161080] [2025-01-10 01:10:38,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:38,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:38,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:38,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:38,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:38,801 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:10:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806161080] [2025-01-10 01:10:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806161080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:38,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:10:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133508482] [2025-01-10 01:10:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:38,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:38,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:38,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:38,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-01-10 01:10:38,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:38,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:38,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-01-10 01:10:38,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:39,246 INFO L124 PetriNetUnfolderBase]: 785/1534 cut-off events. [2025-01-10 01:10:39,247 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 01:10:39,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1534 events. 785/1534 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9371 event pairs, 464 based on Foata normal form. 1/1061 useless extension candidates. Maximal degree in co-relation 2447. Up to 1061 conditions per place. [2025-01-10 01:10:39,267 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-01-10 01:10:39,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 180 flow [2025-01-10 01:10:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-01-10 01:10:39,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2025-01-10 01:10:39,281 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 3 states and 112 transitions. [2025-01-10 01:10:39,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 180 flow [2025-01-10 01:10:39,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:39,291 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 114 flow [2025-01-10 01:10:39,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-01-10 01:10:39,295 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-01-10 01:10:39,298 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 114 flow [2025-01-10 01:10:39,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:39,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:39,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:10:39,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:39,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 434404, now seen corresponding path program 1 times [2025-01-10 01:10:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883672901] [2025-01-10 01:10:39,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:39,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:39,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:39,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:39,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:39,550 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:10:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883672901] [2025-01-10 01:10:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883672901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720808465] [2025-01-10 01:10:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:39,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:39,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:39,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-01-10 01:10:39,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:39,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:39,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-01-10 01:10:39,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:39,781 INFO L124 PetriNetUnfolderBase]: 786/1537 cut-off events. [2025-01-10 01:10:39,781 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:10:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2635 conditions, 1537 events. 786/1537 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9394 event pairs, 464 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 2613. Up to 1066 conditions per place. [2025-01-10 01:10:39,792 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-01-10 01:10:39,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 188 flow [2025-01-10 01:10:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-01-10 01:10:39,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2025-01-10 01:10:39,794 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 114 flow. Second operand 4 states and 142 transitions. [2025-01-10 01:10:39,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 188 flow [2025-01-10 01:10:39,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:39,796 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 137 flow [2025-01-10 01:10:39,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-01-10 01:10:39,798 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-01-10 01:10:39,799 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 137 flow [2025-01-10 01:10:39,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:39,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:39,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:10:39,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:10:39,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:39,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:39,801 INFO L85 PathProgramCache]: Analyzing trace with hash 417476691, now seen corresponding path program 1 times [2025-01-10 01:10:39,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:39,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924381477] [2025-01-10 01:10:39,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:39,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:39,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:39,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:40,070 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:10:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924381477] [2025-01-10 01:10:40,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924381477] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:40,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23907501] [2025-01-10 01:10:40,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:40,074 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:10:40,077 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:10:40,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:40,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:40,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:40,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:40,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:10:40,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:40,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:10:40,373 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:10:40,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:40,460 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:10:40,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23907501] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:40,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:40,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:10:40,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551252021] [2025-01-10 01:10:40,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:40,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:40,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:40,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:40,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:40,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-01-10 01:10:40,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 137 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:40,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:40,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-01-10 01:10:40,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:40,920 INFO L124 PetriNetUnfolderBase]: 787/1539 cut-off events. [2025-01-10 01:10:40,921 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:10:40,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 1539 events. 787/1539 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9376 event pairs, 464 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 2620. Up to 1063 conditions per place. [2025-01-10 01:10:40,929 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 25 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2025-01-10 01:10:40,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 215 flow [2025-01-10 01:10:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2025-01-10 01:10:40,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5360169491525424 [2025-01-10 01:10:40,931 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 137 flow. Second operand 8 states and 253 transitions. [2025-01-10 01:10:40,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 215 flow [2025-01-10 01:10:40,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:40,933 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 162 flow [2025-01-10 01:10:40,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=162, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-01-10 01:10:40,933 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-01-10 01:10:40,934 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 162 flow [2025-01-10 01:10:40,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:40,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:40,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:40,942 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:10:41,138 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:10:41,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:41,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1853062762, now seen corresponding path program 1 times [2025-01-10 01:10:41,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772791604] [2025-01-10 01:10:41,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:10:41,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:10:41,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,201 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:10:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772791604] [2025-01-10 01:10:41,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772791604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:41,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:41,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639472204] [2025-01-10 01:10:41,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:41,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:41,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:41,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:41,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:41,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2025-01-10 01:10:41,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:41,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2025-01-10 01:10:41,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:41,404 INFO L124 PetriNetUnfolderBase]: 1356/2155 cut-off events. [2025-01-10 01:10:41,404 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 01:10:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4064 conditions, 2155 events. 1356/2155 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10724 event pairs, 878 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 4026. Up to 1839 conditions per place. [2025-01-10 01:10:41,414 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 34 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-01-10 01:10:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 226 flow [2025-01-10 01:10:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-01-10 01:10:41,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661016949152542 [2025-01-10 01:10:41,415 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 162 flow. Second operand 4 states and 110 transitions. [2025-01-10 01:10:41,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 226 flow [2025-01-10 01:10:41,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 184 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 01:10:41,416 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 116 flow [2025-01-10 01:10:41,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2025-01-10 01:10:41,417 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2025-01-10 01:10:41,417 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 116 flow [2025-01-10 01:10:41,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:41,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:41,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:10:41,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:41,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1853062763, now seen corresponding path program 1 times [2025-01-10 01:10:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397791050] [2025-01-10 01:10:41,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:10:41,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:10:41,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,462 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:10:41,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397791050] [2025-01-10 01:10:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397791050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147602780] [2025-01-10 01:10:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:41,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:41,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:41,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:41,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:41,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:41,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:41,608 INFO L124 PetriNetUnfolderBase]: 786/1404 cut-off events. [2025-01-10 01:10:41,609 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-10 01:10:41,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 1404 events. 786/1404 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7562 event pairs, 464 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 2479. Up to 1067 conditions per place. [2025-01-10 01:10:41,615 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 32 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-01-10 01:10:41,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 180 flow [2025-01-10 01:10:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-01-10 01:10:41,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2025-01-10 01:10:41,616 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 116 flow. Second operand 3 states and 116 transitions. [2025-01-10 01:10:41,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 180 flow [2025-01-10 01:10:41,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:41,617 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 112 flow [2025-01-10 01:10:41,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-01-10 01:10:41,619 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2025-01-10 01:10:41,619 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 112 flow [2025-01-10 01:10:41,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:41,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:41,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:10:41,619 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:41,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2029273510, now seen corresponding path program 1 times [2025-01-10 01:10:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559546697] [2025-01-10 01:10:41,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:41,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:10:41,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:10:41,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559546697] [2025-01-10 01:10:41,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559546697] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:41,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211922501] [2025-01-10 01:10:41,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:41,692 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:10:41,694 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:10:41,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:10:41,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:10:41,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:41,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:41,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:10:41,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:41,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:41,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211922501] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:41,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:10:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676462446] [2025-01-10 01:10:41,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:41,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:10:41,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:41,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:10:41,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:10:41,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:41,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 112 flow. Second operand has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:41,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:41,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:41,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:42,050 INFO L124 PetriNetUnfolderBase]: 1237/2179 cut-off events. [2025-01-10 01:10:42,051 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-10 01:10:42,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 2179 events. 1237/2179 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12476 event pairs, 645 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 3929. Up to 1063 conditions per place. [2025-01-10 01:10:42,060 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 63 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-01-10 01:10:42,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 336 flow [2025-01-10 01:10:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-01-10 01:10:42,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648910411622276 [2025-01-10 01:10:42,061 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 112 flow. Second operand 7 states and 268 transitions. [2025-01-10 01:10:42,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 336 flow [2025-01-10 01:10:42,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 87 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:42,062 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 139 flow [2025-01-10 01:10:42,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=139, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-01-10 01:10:42,063 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-01-10 01:10:42,063 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 139 flow [2025-01-10 01:10:42,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:42,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:42,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:42,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:42,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:42,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:42,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -351236599, now seen corresponding path program 1 times [2025-01-10 01:10:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:42,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215416894] [2025-01-10 01:10:42,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:42,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:10:42,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:10:42,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:42,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:42,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215416894] [2025-01-10 01:10:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215416894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:42,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383416144] [2025-01-10 01:10:42,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:42,353 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:10:42,360 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:10:42,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:10:42,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:10:42,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:42,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:42,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:42,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:42,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:42,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383416144] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:42,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:42,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-10 01:10:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948186637] [2025-01-10 01:10:42,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:42,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:10:42,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:42,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:10:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:10:42,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:42,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 139 flow. Second operand has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:42,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:42,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:42,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:42,793 INFO L124 PetriNetUnfolderBase]: 1009/1813 cut-off events. [2025-01-10 01:10:42,793 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2025-01-10 01:10:42,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 1813 events. 1009/1813 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10125 event pairs, 566 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 2629. Up to 1063 conditions per place. [2025-01-10 01:10:42,801 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 56 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-01-10 01:10:42,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 339 flow [2025-01-10 01:10:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-01-10 01:10:42,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319612590799032 [2025-01-10 01:10:42,802 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 139 flow. Second operand 7 states and 261 transitions. [2025-01-10 01:10:42,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 339 flow [2025-01-10 01:10:42,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:42,804 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 159 flow [2025-01-10 01:10:42,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-01-10 01:10:42,804 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2025-01-10 01:10:42,804 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 159 flow [2025-01-10 01:10:42,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:42,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:42,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:42,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:43,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:43,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:43,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -627851639, now seen corresponding path program 2 times [2025-01-10 01:10:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610396509] [2025-01-10 01:10:43,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:10:43,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-01-10 01:10:43,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:10:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610396509] [2025-01-10 01:10:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610396509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164716637] [2025-01-10 01:10:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:43,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:43,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:10:43,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:10:43,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:43,677 INFO L124 PetriNetUnfolderBase]: 1752/2982 cut-off events. [2025-01-10 01:10:43,677 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2025-01-10 01:10:43,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6291 conditions, 2982 events. 1752/2982 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17077 event pairs, 746 based on Foata normal form. 62/2398 useless extension candidates. Maximal degree in co-relation 5204. Up to 1754 conditions per place. [2025-01-10 01:10:43,688 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2025-01-10 01:10:43,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 90 transitions, 411 flow [2025-01-10 01:10:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-01-10 01:10:43,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6299435028248588 [2025-01-10 01:10:43,694 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 159 flow. Second operand 6 states and 223 transitions. [2025-01-10 01:10:43,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 90 transitions, 411 flow [2025-01-10 01:10:43,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 400 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:43,696 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 193 flow [2025-01-10 01:10:43,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2025-01-10 01:10:43,697 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-01-10 01:10:43,697 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 193 flow [2025-01-10 01:10:43,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:43,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:43,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:10:43,697 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash 984881598, now seen corresponding path program 1 times [2025-01-10 01:10:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99226810] [2025-01-10 01:10:43,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:43,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:10:43,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:10:43,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99226810] [2025-01-10 01:10:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99226810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372332797] [2025-01-10 01:10:43,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:43,765 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:10:43,767 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:10:43,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:10:43,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:10:43,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:43,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:43,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:43,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:43,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:43,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:43,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372332797] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:43,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:43,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-10 01:10:43,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680613986] [2025-01-10 01:10:43,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:43,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:10:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:43,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:10:43,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:10:43,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:43,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 193 flow. Second operand has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:43,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:43,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:43,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:44,213 INFO L124 PetriNetUnfolderBase]: 1396/2478 cut-off events. [2025-01-10 01:10:44,213 INFO L125 PetriNetUnfolderBase]: For 1755/1803 co-relation queries the response was YES. [2025-01-10 01:10:44,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 2478 events. 1396/2478 cut-off events. For 1755/1803 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14492 event pairs, 815 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 5118. Up to 1689 conditions per place. [2025-01-10 01:10:44,223 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 52 selfloop transitions, 8 changer transitions 0/76 dead transitions. [2025-01-10 01:10:44,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 381 flow [2025-01-10 01:10:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:10:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:10:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions. [2025-01-10 01:10:44,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6150121065375302 [2025-01-10 01:10:44,224 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 193 flow. Second operand 7 states and 254 transitions. [2025-01-10 01:10:44,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 381 flow [2025-01-10 01:10:44,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 364 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:44,227 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 209 flow [2025-01-10 01:10:44,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2025-01-10 01:10:44,228 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-01-10 01:10:44,228 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 209 flow [2025-01-10 01:10:44,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:44,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:44,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:44,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:44,432 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,SelfDestructingSolverStorable8 [2025-01-10 01:10:44,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:44,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:44,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2090417784, now seen corresponding path program 2 times [2025-01-10 01:10:44,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:44,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238804751] [2025-01-10 01:10:44,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:44,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:44,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-10 01:10:44,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-01-10 01:10:44,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:10:44,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:44,563 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:44,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238804751] [2025-01-10 01:10:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238804751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:44,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:44,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642005952] [2025-01-10 01:10:44,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:44,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:44,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:44,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:44,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:44,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-01-10 01:10:44,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:44,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:44,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-01-10 01:10:44,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:44,971 INFO L124 PetriNetUnfolderBase]: 2758/4473 cut-off events. [2025-01-10 01:10:44,971 INFO L125 PetriNetUnfolderBase]: For 2435/2511 co-relation queries the response was YES. [2025-01-10 01:10:44,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10721 conditions, 4473 events. 2758/4473 cut-off events. For 2435/2511 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 26108 event pairs, 1116 based on Foata normal form. 101/3744 useless extension candidates. Maximal degree in co-relation 9887. Up to 2644 conditions per place. [2025-01-10 01:10:44,990 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 78 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2025-01-10 01:10:44,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 551 flow [2025-01-10 01:10:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-01-10 01:10:44,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242937853107344 [2025-01-10 01:10:44,991 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 209 flow. Second operand 6 states and 221 transitions. [2025-01-10 01:10:44,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 551 flow [2025-01-10 01:10:44,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 101 transitions, 540 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:44,996 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 243 flow [2025-01-10 01:10:44,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2025-01-10 01:10:44,996 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-01-10 01:10:44,996 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 243 flow [2025-01-10 01:10:44,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:44,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:44,997 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:44,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:10:44,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:44,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash 255779980, now seen corresponding path program 1 times [2025-01-10 01:10:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:44,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743564071] [2025-01-10 01:10:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:44,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:45,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:10:45,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:10:45,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:45,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:45,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743564071] [2025-01-10 01:10:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743564071] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:45,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507860831] [2025-01-10 01:10:45,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:45,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:45,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:45,071 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:10:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 01:10:45,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 01:10:45,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:45,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:45,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:10:45,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:45,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:45,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507860831] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:45,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-01-10 01:10:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193559343] [2025-01-10 01:10:45,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:45,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:10:45,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:45,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:10:45,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:10:45,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:45,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 243 flow. Second operand has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:45,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:45,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:45,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:45,807 INFO L124 PetriNetUnfolderBase]: 3682/6464 cut-off events. [2025-01-10 01:10:45,808 INFO L125 PetriNetUnfolderBase]: For 5596/5748 co-relation queries the response was YES. [2025-01-10 01:10:45,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16990 conditions, 6464 events. 3682/6464 cut-off events. For 5596/5748 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 44678 event pairs, 1493 based on Foata normal form. 0/5435 useless extension candidates. Maximal degree in co-relation 9287. Up to 2672 conditions per place. [2025-01-10 01:10:45,836 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 104 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2025-01-10 01:10:45,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 781 flow [2025-01-10 01:10:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:10:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:10:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2025-01-10 01:10:45,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516007532956686 [2025-01-10 01:10:45,838 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 243 flow. Second operand 9 states and 346 transitions. [2025-01-10 01:10:45,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 781 flow [2025-01-10 01:10:45,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 134 transitions, 741 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:45,847 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 318 flow [2025-01-10 01:10:45,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2025-01-10 01:10:45,848 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2025-01-10 01:10:45,848 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 318 flow [2025-01-10 01:10:45,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:45,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:45,848 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:45,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:46,048 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,SelfDestructingSolverStorable10 [2025-01-10 01:10:46,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:46,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1932367251, now seen corresponding path program 2 times [2025-01-10 01:10:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323661310] [2025-01-10 01:10:46,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:46,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:10:46,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-01-10 01:10:46,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:10:46,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:46,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:46,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323661310] [2025-01-10 01:10:46,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323661310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:46,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:46,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384896414] [2025-01-10 01:10:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:46,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:46,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:46,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:46,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-01-10 01:10:46,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:46,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:46,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-01-10 01:10:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:46,906 INFO L124 PetriNetUnfolderBase]: 4489/7063 cut-off events. [2025-01-10 01:10:46,906 INFO L125 PetriNetUnfolderBase]: For 10266/10420 co-relation queries the response was YES. [2025-01-10 01:10:46,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20254 conditions, 7063 events. 4489/7063 cut-off events. For 10266/10420 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 43188 event pairs, 1028 based on Foata normal form. 0/6129 useless extension candidates. Maximal degree in co-relation 14993. Up to 2367 conditions per place. [2025-01-10 01:10:46,933 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 94 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-01-10 01:10:46,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 822 flow [2025-01-10 01:10:46,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2025-01-10 01:10:46,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875706214689266 [2025-01-10 01:10:46,935 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 318 flow. Second operand 6 states and 208 transitions. [2025-01-10 01:10:46,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 822 flow [2025-01-10 01:10:46,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 805 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:46,948 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 325 flow [2025-01-10 01:10:46,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2025-01-10 01:10:46,948 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-01-10 01:10:46,948 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 325 flow [2025-01-10 01:10:46,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:46,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:46,949 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:10:46,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:46,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 15378877, now seen corresponding path program 2 times [2025-01-10 01:10:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677014595] [2025-01-10 01:10:46,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:46,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:10:46,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:46,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:46,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:10:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677014595] [2025-01-10 01:10:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677014595] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001832662] [2025-01-10 01:10:47,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:47,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:47,212 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:10:47,214 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:10:47,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 01:10:47,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:47,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:47,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:47,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:10:47,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:47,277 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:10:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:10:47,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:10:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001832662] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:47,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-01-10 01:10:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765360989] [2025-01-10 01:10:47,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:47,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 01:10:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:47,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 01:10:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-10 01:10:48,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-01-10 01:10:48,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 325 flow. Second operand has 17 states, 17 states have (on average 24.764705882352942) internal successors, (421), 17 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:48,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:48,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-01-10 01:10:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:49,564 INFO L124 PetriNetUnfolderBase]: 8785/12883 cut-off events. [2025-01-10 01:10:49,564 INFO L125 PetriNetUnfolderBase]: For 15850/15974 co-relation queries the response was YES. [2025-01-10 01:10:49,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38709 conditions, 12883 events. 8785/12883 cut-off events. For 15850/15974 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 75975 event pairs, 1022 based on Foata normal form. 284/11639 useless extension candidates. Maximal degree in co-relation 25803. Up to 3714 conditions per place. [2025-01-10 01:10:49,618 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 170 selfloop transitions, 25 changer transitions 0/204 dead transitions. [2025-01-10 01:10:49,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 204 transitions, 1292 flow [2025-01-10 01:10:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 379 transitions. [2025-01-10 01:10:49,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423728813559322 [2025-01-10 01:10:49,621 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 325 flow. Second operand 10 states and 379 transitions. [2025-01-10 01:10:49,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 204 transitions, 1292 flow [2025-01-10 01:10:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 204 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:49,669 INFO L231 Difference]: Finished difference. Result has 84 places, 74 transitions, 414 flow [2025-01-10 01:10:49,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=414, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2025-01-10 01:10:49,670 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-01-10 01:10:49,670 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 414 flow [2025-01-10 01:10:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 24.764705882352942) internal successors, (421), 17 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:49,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:49,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:49,874 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,SelfDestructingSolverStorable12 [2025-01-10 01:10:49,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:49,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1388193591, now seen corresponding path program 1 times [2025-01-10 01:10:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248329509] [2025-01-10 01:10:49,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:49,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:49,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:49,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:49,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:49,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:49,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248329509] [2025-01-10 01:10:49,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248329509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:49,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198650885] [2025-01-10 01:10:49,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:49,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:49,967 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:10:49,969 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:10:50,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:10:50,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:10:50,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:50,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:50,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:10:50,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:50,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:50,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198650885] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:50,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:50,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:10:50,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869289492] [2025-01-10 01:10:50,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:50,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:10:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:50,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:10:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:10:50,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:50,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 414 flow. Second operand has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:50,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:50,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:50,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:51,035 INFO L124 PetriNetUnfolderBase]: 5626/8952 cut-off events. [2025-01-10 01:10:51,035 INFO L125 PetriNetUnfolderBase]: For 18838/18972 co-relation queries the response was YES. [2025-01-10 01:10:51,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29291 conditions, 8952 events. 5626/8952 cut-off events. For 18838/18972 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 56596 event pairs, 2409 based on Foata normal form. 7/7711 useless extension candidates. Maximal degree in co-relation 19815. Up to 4640 conditions per place. [2025-01-10 01:10:51,095 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 112 selfloop transitions, 14 changer transitions 0/140 dead transitions. [2025-01-10 01:10:51,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1041 flow [2025-01-10 01:10:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:10:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:10:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 344 transitions. [2025-01-10 01:10:51,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647834274952919 [2025-01-10 01:10:51,097 INFO L175 Difference]: Start difference. First operand has 84 places, 74 transitions, 414 flow. Second operand 9 states and 344 transitions. [2025-01-10 01:10:51,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1041 flow [2025-01-10 01:10:51,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 140 transitions, 936 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:51,122 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 426 flow [2025-01-10 01:10:51,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=426, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-01-10 01:10:51,123 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-01-10 01:10:51,123 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 426 flow [2025-01-10 01:10:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:51,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:51,124 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:51,130 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:10:51,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:51,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:51,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -485419590, now seen corresponding path program 2 times [2025-01-10 01:10:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955238343] [2025-01-10 01:10:51,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:51,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:10:51,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:10:51,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:51,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:10:51,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955238343] [2025-01-10 01:10:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955238343] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862469503] [2025-01-10 01:10:51,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:51,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:51,534 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:10:51,535 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:10:51,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:10:51,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 01:10:51,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:51,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:51,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 01:10:51,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:51,602 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:10:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:51,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862469503] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:51,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-01-10 01:10:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228412482] [2025-01-10 01:10:51,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:51,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:10:51,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:51,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:10:51,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:10:52,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 01:10:52,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 426 flow. Second operand has 21 states, 21 states have (on average 26.095238095238095) internal successors, (548), 21 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:52,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:52,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 01:10:52,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:53,821 INFO L124 PetriNetUnfolderBase]: 8030/12054 cut-off events. [2025-01-10 01:10:53,822 INFO L125 PetriNetUnfolderBase]: For 17147/17271 co-relation queries the response was YES. [2025-01-10 01:10:53,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37491 conditions, 12054 events. 8030/12054 cut-off events. For 17147/17271 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 72504 event pairs, 927 based on Foata normal form. 630/10848 useless extension candidates. Maximal degree in co-relation 26457. Up to 2791 conditions per place. [2025-01-10 01:10:53,876 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 222 selfloop transitions, 21 changer transitions 0/253 dead transitions. [2025-01-10 01:10:53,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 253 transitions, 1695 flow [2025-01-10 01:10:53,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-10 01:10:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-01-10 01:10:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 571 transitions. [2025-01-10 01:10:53,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048728813559322 [2025-01-10 01:10:53,880 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 426 flow. Second operand 16 states and 571 transitions. [2025-01-10 01:10:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 253 transitions, 1695 flow [2025-01-10 01:10:53,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 253 transitions, 1677 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:53,928 INFO L231 Difference]: Finished difference. Result has 98 places, 79 transitions, 464 flow [2025-01-10 01:10:53,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=464, PETRI_PLACES=98, PETRI_TRANSITIONS=79} [2025-01-10 01:10:53,929 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 40 predicate places. [2025-01-10 01:10:53,929 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 79 transitions, 464 flow [2025-01-10 01:10:53,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 26.095238095238095) internal successors, (548), 21 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:53,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:53,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:53,935 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:10:54,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 01:10:54,134 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:54,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:54,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1283627428, now seen corresponding path program 1 times [2025-01-10 01:10:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178174802] [2025-01-10 01:10:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:54,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 01:10:54,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 01:10:54,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:54,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:54,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178174802] [2025-01-10 01:10:54,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178174802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:54,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:54,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909552251] [2025-01-10 01:10:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:54,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:54,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:54,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:54,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:54,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 79 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:54,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:54,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:54,983 INFO L124 PetriNetUnfolderBase]: 8973/13762 cut-off events. [2025-01-10 01:10:54,983 INFO L125 PetriNetUnfolderBase]: For 30467/30771 co-relation queries the response was YES. [2025-01-10 01:10:55,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45954 conditions, 13762 events. 8973/13762 cut-off events. For 30467/30771 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 88191 event pairs, 1922 based on Foata normal form. 23/11839 useless extension candidates. Maximal degree in co-relation 33874. Up to 9030 conditions per place. [2025-01-10 01:10:55,042 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 86 selfloop transitions, 7 changer transitions 8/113 dead transitions. [2025-01-10 01:10:55,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 113 transitions, 872 flow [2025-01-10 01:10:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:55,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-01-10 01:10:55,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7740112994350282 [2025-01-10 01:10:55,043 INFO L175 Difference]: Start difference. First operand has 98 places, 79 transitions, 464 flow. Second operand 3 states and 137 transitions. [2025-01-10 01:10:55,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 113 transitions, 872 flow [2025-01-10 01:10:55,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 113 transitions, 779 flow, removed 15 selfloop flow, removed 14 redundant places. [2025-01-10 01:10:55,090 INFO L231 Difference]: Finished difference. Result has 87 places, 77 transitions, 392 flow [2025-01-10 01:10:55,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=87, PETRI_TRANSITIONS=77} [2025-01-10 01:10:55,091 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2025-01-10 01:10:55,092 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 77 transitions, 392 flow [2025-01-10 01:10:55,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:55,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:55,093 INFO L206 CegarLoopForPetriNet]: trace histogram [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:10:55,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:10:55,093 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1339301208, now seen corresponding path program 1 times [2025-01-10 01:10:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870900271] [2025-01-10 01:10:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:55,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:10:55,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:55,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:55,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870900271] [2025-01-10 01:10:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870900271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:55,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:10:55,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430339599] [2025-01-10 01:10:55,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:55,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:55,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:55,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:55,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 77 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:55,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:55,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:55,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:56,038 INFO L124 PetriNetUnfolderBase]: 9125/14091 cut-off events. [2025-01-10 01:10:56,038 INFO L125 PetriNetUnfolderBase]: For 23565/23696 co-relation queries the response was YES. [2025-01-10 01:10:56,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44789 conditions, 14091 events. 9125/14091 cut-off events. For 23565/23696 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 91399 event pairs, 2217 based on Foata normal form. 0/12209 useless extension candidates. Maximal degree in co-relation 33217. Up to 4776 conditions per place. [2025-01-10 01:10:56,115 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 129 selfloop transitions, 14 changer transitions 2/157 dead transitions. [2025-01-10 01:10:56,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 157 transitions, 1104 flow [2025-01-10 01:10:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-01-10 01:10:56,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.692090395480226 [2025-01-10 01:10:56,118 INFO L175 Difference]: Start difference. First operand has 87 places, 77 transitions, 392 flow. Second operand 6 states and 245 transitions. [2025-01-10 01:10:56,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 157 transitions, 1104 flow [2025-01-10 01:10:56,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 157 transitions, 1031 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:56,300 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 405 flow [2025-01-10 01:10:56,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2025-01-10 01:10:56,301 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2025-01-10 01:10:56,301 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 405 flow [2025-01-10 01:10:56,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:56,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:56,301 INFO L206 CegarLoopForPetriNet]: trace histogram [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:10:56,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:10:56,302 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1626505350, now seen corresponding path program 2 times [2025-01-10 01:10:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2354239] [2025-01-10 01:10:56,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:56,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:10:56,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:56,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:56,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2354239] [2025-01-10 01:10:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2354239] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851543104] [2025-01-10 01:10:56,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:56,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:56,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:56,384 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:56,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 01:10:56,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:10:56,448 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:56,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:56,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:56,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 01:10:56,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:56,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851543104] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:56,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-01-10 01:10:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615382333] [2025-01-10 01:10:56,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:56,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:56,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:56,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:10:56,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:56,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:56,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:56,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:56,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:57,355 INFO L124 PetriNetUnfolderBase]: 7219/11341 cut-off events. [2025-01-10 01:10:57,355 INFO L125 PetriNetUnfolderBase]: For 24897/25030 co-relation queries the response was YES. [2025-01-10 01:10:57,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33893 conditions, 11341 events. 7219/11341 cut-off events. For 24897/25030 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 72583 event pairs, 1788 based on Foata normal form. 660/10356 useless extension candidates. Maximal degree in co-relation 24032. Up to 5370 conditions per place. [2025-01-10 01:10:57,419 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 77 selfloop transitions, 12 changer transitions 0/101 dead transitions. [2025-01-10 01:10:57,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 669 flow [2025-01-10 01:10:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-01-10 01:10:57,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2025-01-10 01:10:57,421 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 405 flow. Second operand 6 states and 217 transitions. [2025-01-10 01:10:57,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 669 flow [2025-01-10 01:10:57,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 630 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:57,462 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 342 flow [2025-01-10 01:10:57,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-01-10 01:10:57,463 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-01-10 01:10:57,463 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 342 flow [2025-01-10 01:10:57,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:57,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:57,463 INFO L206 CegarLoopForPetriNet]: trace histogram [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:10:57,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:57,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 01:10:57,668 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:57,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash 578450484, now seen corresponding path program 1 times [2025-01-10 01:10:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:57,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617658853] [2025-01-10 01:10:57,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:57,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:10:57,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:57,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:57,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:57,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617658853] [2025-01-10 01:10:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617658853] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137211540] [2025-01-10 01:10:57,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:57,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:57,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:57,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:57,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 01:10:57,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:10:57,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:57,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:57,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:57,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:10:57,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:57,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:58,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137211540] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:58,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:58,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-01-10 01:10:58,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155492199] [2025-01-10 01:10:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:58,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:10:58,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:58,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:10:58,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:10:58,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:58,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:58,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:58,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:58,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:58,705 INFO L124 PetriNetUnfolderBase]: 7031/11425 cut-off events. [2025-01-10 01:10:58,705 INFO L125 PetriNetUnfolderBase]: For 16929/16944 co-relation queries the response was YES. [2025-01-10 01:10:58,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32589 conditions, 11425 events. 7031/11425 cut-off events. For 16929/16944 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 78945 event pairs, 1404 based on Foata normal form. 0/10115 useless extension candidates. Maximal degree in co-relation 23239. Up to 3017 conditions per place. [2025-01-10 01:10:58,776 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 163 selfloop transitions, 29 changer transitions 0/204 dead transitions. [2025-01-10 01:10:58,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 204 transitions, 1440 flow [2025-01-10 01:10:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 381 transitions. [2025-01-10 01:10:58,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457627118644068 [2025-01-10 01:10:58,778 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 342 flow. Second operand 10 states and 381 transitions. [2025-01-10 01:10:58,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 204 transitions, 1440 flow [2025-01-10 01:10:58,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 204 transitions, 1326 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 01:10:58,813 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 472 flow [2025-01-10 01:10:58,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=472, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2025-01-10 01:10:58,813 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-01-10 01:10:58,814 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 472 flow [2025-01-10 01:10:58,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:58,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:58,814 INFO L206 CegarLoopForPetriNet]: trace histogram [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:10:58,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:59,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:10:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash -544258720, now seen corresponding path program 2 times [2025-01-10 01:10:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633787373] [2025-01-10 01:10:59,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:59,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:59,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:10:59,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:59,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:59,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:10:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633787373] [2025-01-10 01:10:59,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633787373] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736601967] [2025-01-10 01:10:59,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:59,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:59,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:59,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 01:10:59,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:10:59,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:10:59,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:59,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:59,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:10:59,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:59,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:10:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736601967] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2025-01-10 01:10:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116441175] [2025-01-10 01:10:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:59,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:10:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:59,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:10:59,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-10 01:10:59,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:10:59,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 472 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:59,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:59,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:10:59,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:00,044 INFO L124 PetriNetUnfolderBase]: 8458/13605 cut-off events. [2025-01-10 01:11:00,045 INFO L125 PetriNetUnfolderBase]: For 21287/21366 co-relation queries the response was YES. [2025-01-10 01:11:00,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40466 conditions, 13605 events. 8458/13605 cut-off events. For 21287/21366 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 95234 event pairs, 1431 based on Foata normal form. 40/12252 useless extension candidates. Maximal degree in co-relation 29162. Up to 3159 conditions per place. [2025-01-10 01:11:00,199 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 165 selfloop transitions, 55 changer transitions 0/232 dead transitions. [2025-01-10 01:11:00,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 232 transitions, 1678 flow [2025-01-10 01:11:00,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:11:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:11:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 374 transitions. [2025-01-10 01:11:00,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338983050847458 [2025-01-10 01:11:00,200 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 472 flow. Second operand 10 states and 374 transitions. [2025-01-10 01:11:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 232 transitions, 1678 flow [2025-01-10 01:11:00,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 232 transitions, 1673 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:00,254 INFO L231 Difference]: Finished difference. Result has 96 places, 121 transitions, 911 flow [2025-01-10 01:11:00,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=911, PETRI_PLACES=96, PETRI_TRANSITIONS=121} [2025-01-10 01:11:00,254 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 38 predicate places. [2025-01-10 01:11:00,254 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 911 flow [2025-01-10 01:11:00,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:00,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:00,255 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:00,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-10 01:11:00,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:00,456 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:00,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash 561210432, now seen corresponding path program 3 times [2025-01-10 01:11:00,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:00,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315353508] [2025-01-10 01:11:00,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:00,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:00,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 26 statements. [2025-01-10 01:11:00,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:00,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315353508] [2025-01-10 01:11:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315353508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010706280] [2025-01-10 01:11:00,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:11:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:00,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:00,530 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:11:00,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 01:11:00,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:00,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 26 statements. [2025-01-10 01:11:00,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:11:00,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:00,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:00,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:00,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010706280] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:00,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:00,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2025-01-10 01:11:00,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361303828] [2025-01-10 01:11:00,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:00,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:11:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:00,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:11:00,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:11:00,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:00,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 911 flow. Second operand has 14 states, 14 states have (on average 31.0) internal successors, (434), 14 states have internal predecessors, (434), 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:11:00,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:00,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:00,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:03,093 INFO L124 PetriNetUnfolderBase]: 14865/23720 cut-off events. [2025-01-10 01:11:03,093 INFO L125 PetriNetUnfolderBase]: For 82665/83113 co-relation queries the response was YES. [2025-01-10 01:11:03,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83777 conditions, 23720 events. 14865/23720 cut-off events. For 82665/83113 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 177844 event pairs, 774 based on Foata normal form. 26/21455 useless extension candidates. Maximal degree in co-relation 70966. Up to 5348 conditions per place. [2025-01-10 01:11:03,332 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 436 selfloop transitions, 480 changer transitions 0/928 dead transitions. [2025-01-10 01:11:03,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 928 transitions, 9251 flow [2025-01-10 01:11:03,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-10 01:11:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-01-10 01:11:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1422 transitions. [2025-01-10 01:11:03,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6513971598717362 [2025-01-10 01:11:03,337 INFO L175 Difference]: Start difference. First operand has 96 places, 121 transitions, 911 flow. Second operand 37 states and 1422 transitions. [2025-01-10 01:11:03,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 928 transitions, 9251 flow [2025-01-10 01:11:03,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 928 transitions, 9182 flow, removed 32 selfloop flow, removed 3 redundant places. [2025-01-10 01:11:03,723 INFO L231 Difference]: Finished difference. Result has 156 places, 629 transitions, 7866 flow [2025-01-10 01:11:03,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7866, PETRI_PLACES=156, PETRI_TRANSITIONS=629} [2025-01-10 01:11:03,728 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 98 predicate places. [2025-01-10 01:11:03,728 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 629 transitions, 7866 flow [2025-01-10 01:11:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 31.0) internal successors, (434), 14 states have internal predecessors, (434), 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:11:03,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:03,728 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:03,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-10 01:11:03,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:03,930 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:03,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2125586340, now seen corresponding path program 4 times [2025-01-10 01:11:03,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:03,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484747675] [2025-01-10 01:11:03,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:11:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:03,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:03,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:03,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:11:03,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484747675] [2025-01-10 01:11:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484747675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:11:03,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:11:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:11:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358626549] [2025-01-10 01:11:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:11:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:03,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:11:03,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:11:04,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:04,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 629 transitions, 7866 flow. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 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:11:04,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:04,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:04,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:06,881 INFO L124 PetriNetUnfolderBase]: 17133/26629 cut-off events. [2025-01-10 01:11:06,882 INFO L125 PetriNetUnfolderBase]: For 202107/202727 co-relation queries the response was YES. [2025-01-10 01:11:07,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121904 conditions, 26629 events. 17133/26629 cut-off events. For 202107/202727 co-relation queries the response was YES. Maximal size of possible extension queue 1343. Compared 196671 event pairs, 3350 based on Foata normal form. 38/24658 useless extension candidates. Maximal degree in co-relation 119062. Up to 11149 conditions per place. [2025-01-10 01:11:07,134 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 520 selfloop transitions, 309 changer transitions 3/844 dead transitions. [2025-01-10 01:11:07,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 844 transitions, 11618 flow [2025-01-10 01:11:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:11:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:11:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2025-01-10 01:11:07,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6828087167070218 [2025-01-10 01:11:07,136 INFO L175 Difference]: Start difference. First operand has 156 places, 629 transitions, 7866 flow. Second operand 7 states and 282 transitions. [2025-01-10 01:11:07,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 844 transitions, 11618 flow [2025-01-10 01:11:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 844 transitions, 11222 flow, removed 137 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:08,732 INFO L231 Difference]: Finished difference. Result has 165 places, 694 transitions, 9497 flow [2025-01-10 01:11:08,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=7580, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9497, PETRI_PLACES=165, PETRI_TRANSITIONS=694} [2025-01-10 01:11:08,736 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 107 predicate places. [2025-01-10 01:11:08,736 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 694 transitions, 9497 flow [2025-01-10 01:11:08,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 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:11:08,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:08,737 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:08,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:11:08,737 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:08,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash 488278442, now seen corresponding path program 5 times [2025-01-10 01:11:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241042344] [2025-01-10 01:11:08,738 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:08,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:08,742 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:08,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:08,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:08,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:08,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241042344] [2025-01-10 01:11:08,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241042344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:08,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771472281] [2025-01-10 01:11:08,783 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:11:08,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:08,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:08,784 INFO L229 MonitoredProcess]: Starting monitored process 14 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:11:08,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 01:11:08,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:08,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:08,841 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:11:08,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:08,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 01:11:08,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:08,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771472281] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:11:08,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:11:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-10 01:11:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688089778] [2025-01-10 01:11:08,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:11:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:11:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:08,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:11:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:11:08,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:08,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 694 transitions, 9497 flow. Second operand has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 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:11:08,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:08,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:08,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:14,155 INFO L124 PetriNetUnfolderBase]: 24686/38844 cut-off events. [2025-01-10 01:11:14,155 INFO L125 PetriNetUnfolderBase]: For 302055/302977 co-relation queries the response was YES. [2025-01-10 01:11:14,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175035 conditions, 38844 events. 24686/38844 cut-off events. For 302055/302977 co-relation queries the response was YES. Maximal size of possible extension queue 1804. Compared 306771 event pairs, 3432 based on Foata normal form. 140/36084 useless extension candidates. Maximal degree in co-relation 169331. Up to 11879 conditions per place. [2025-01-10 01:11:14,582 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 638 selfloop transitions, 591 changer transitions 0/1241 dead transitions. [2025-01-10 01:11:14,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1241 transitions, 17795 flow [2025-01-10 01:11:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:11:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 01:11:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 665 transitions. [2025-01-10 01:11:14,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6630109670987039 [2025-01-10 01:11:14,594 INFO L175 Difference]: Start difference. First operand has 165 places, 694 transitions, 9497 flow. Second operand 17 states and 665 transitions. [2025-01-10 01:11:14,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1241 transitions, 17795 flow [2025-01-10 01:11:17,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 1241 transitions, 17375 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:17,171 INFO L231 Difference]: Finished difference. Result has 192 places, 963 transitions, 15530 flow [2025-01-10 01:11:17,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=9219, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=15530, PETRI_PLACES=192, PETRI_TRANSITIONS=963} [2025-01-10 01:11:17,172 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 134 predicate places. [2025-01-10 01:11:17,172 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 963 transitions, 15530 flow [2025-01-10 01:11:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.666666666666668) internal successors, (368), 12 states have internal predecessors, (368), 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:11:17,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:17,173 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:17,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:17,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:17,373 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:17,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:17,374 INFO L85 PathProgramCache]: Analyzing trace with hash -531808500, now seen corresponding path program 6 times [2025-01-10 01:11:17,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:17,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740181584] [2025-01-10 01:11:17,374 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:17,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:17,380 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:17,384 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-01-10 01:11:17,384 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-10 01:11:17,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740181584] [2025-01-10 01:11:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740181584] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597754130] [2025-01-10 01:11:17,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:11:17,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:17,450 INFO L229 MonitoredProcess]: Starting monitored process 15 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:11:17,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 01:11:17,493 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-01-10 01:11:17,509 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 26 statements. [2025-01-10 01:11:17,509 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-10 01:11:17,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:17,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:11:17,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:17,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:17,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:17,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597754130] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:17,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:17,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2025-01-10 01:11:17,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885397845] [2025-01-10 01:11:17,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:17,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:11:17,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:17,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:11:17,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:11:17,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:17,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 963 transitions, 15530 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:17,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:17,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:17,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:24,229 INFO L124 PetriNetUnfolderBase]: 27943/43347 cut-off events. [2025-01-10 01:11:24,230 INFO L125 PetriNetUnfolderBase]: For 440160/441448 co-relation queries the response was YES. [2025-01-10 01:11:24,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217644 conditions, 43347 events. 27943/43347 cut-off events. For 440160/441448 co-relation queries the response was YES. Maximal size of possible extension queue 2036. Compared 340026 event pairs, 3900 based on Foata normal form. 129/40241 useless extension candidates. Maximal degree in co-relation 212755. Up to 12233 conditions per place. [2025-01-10 01:11:24,870 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 564 selfloop transitions, 686 changer transitions 0/1262 dead transitions. [2025-01-10 01:11:24,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1262 transitions, 21258 flow [2025-01-10 01:11:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:11:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:11:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 391 transitions. [2025-01-10 01:11:24,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6627118644067796 [2025-01-10 01:11:24,871 INFO L175 Difference]: Start difference. First operand has 192 places, 963 transitions, 15530 flow. Second operand 10 states and 391 transitions. [2025-01-10 01:11:24,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 1262 transitions, 21258 flow [2025-01-10 01:11:30,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 1262 transitions, 20167 flow, removed 318 selfloop flow, removed 2 redundant places. [2025-01-10 01:11:30,223 INFO L231 Difference]: Finished difference. Result has 203 places, 1051 transitions, 18424 flow [2025-01-10 01:11:30,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=14535, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=592, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18424, PETRI_PLACES=203, PETRI_TRANSITIONS=1051} [2025-01-10 01:11:30,224 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 145 predicate places. [2025-01-10 01:11:30,224 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 1051 transitions, 18424 flow [2025-01-10 01:11:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:30,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:30,225 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:30,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-10 01:11:30,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:11:30,425 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1640346540, now seen corresponding path program 7 times [2025-01-10 01:11:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035829208] [2025-01-10 01:11:30,426 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:30,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:11:30,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035829208] [2025-01-10 01:11:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035829208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405650436] [2025-01-10 01:11:30,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:11:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:30,490 INFO L229 MonitoredProcess]: Starting monitored process 16 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:11:30,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-10 01:11:30,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:11:30,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:30,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:11:30,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:30,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:11:30,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:30,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405650436] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2025-01-10 01:11:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002130482] [2025-01-10 01:11:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:11:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:11:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:11:30,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:30,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 1051 transitions, 18424 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:30,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:30,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:30,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:11:37,414 INFO L124 PetriNetUnfolderBase]: 27838/43268 cut-off events. [2025-01-10 01:11:37,415 INFO L125 PetriNetUnfolderBase]: For 433061/434220 co-relation queries the response was YES. [2025-01-10 01:11:37,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215656 conditions, 43268 events. 27838/43268 cut-off events. For 433061/434220 co-relation queries the response was YES. Maximal size of possible extension queue 2055. Compared 340510 event pairs, 2676 based on Foata normal form. 178/40185 useless extension candidates. Maximal degree in co-relation 214390. Up to 12898 conditions per place. [2025-01-10 01:11:38,131 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 526 selfloop transitions, 685 changer transitions 0/1223 dead transitions. [2025-01-10 01:11:38,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1223 transitions, 22237 flow [2025-01-10 01:11:38,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:11:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:11:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 344 transitions. [2025-01-10 01:11:38,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647834274952919 [2025-01-10 01:11:38,137 INFO L175 Difference]: Start difference. First operand has 203 places, 1051 transitions, 18424 flow. Second operand 9 states and 344 transitions. [2025-01-10 01:11:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 1223 transitions, 22237 flow [2025-01-10 01:11:43,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1223 transitions, 21923 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-01-10 01:11:43,098 INFO L231 Difference]: Finished difference. Result has 209 places, 1059 transitions, 20329 flow [2025-01-10 01:11:43,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=18110, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=677, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=20329, PETRI_PLACES=209, PETRI_TRANSITIONS=1059} [2025-01-10 01:11:43,099 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 151 predicate places. [2025-01-10 01:11:43,099 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 1059 transitions, 20329 flow [2025-01-10 01:11:43,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:43,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:11:43,100 INFO L206 CegarLoopForPetriNet]: trace histogram [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:11:43,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-10 01:11:43,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:11:43,301 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-01-10 01:11:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:11:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1054387030, now seen corresponding path program 8 times [2025-01-10 01:11:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:11:43,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352446103] [2025-01-10 01:11:43,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:11:43,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:43,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:43,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:43,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 01:11:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:11:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352446103] [2025-01-10 01:11:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352446103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019769162] [2025-01-10 01:11:43,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:11:43,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:11:43,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:11:43,386 INFO L229 MonitoredProcess]: Starting monitored process 17 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:11:43,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-10 01:11:43,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-10 01:11:43,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:11:43,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:11:43,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:11:43,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 01:11:43,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:11:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:43,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:11:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:11:43,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019769162] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:11:43,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:11:43,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 18 [2025-01-10 01:11:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497185685] [2025-01-10 01:11:43,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:11:43,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:11:43,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:11:43,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:11:43,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:11:43,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-01-10 01:11:43,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 1059 transitions, 20329 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 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:11:43,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:11:43,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-01-10 01:11:43,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand