./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:01:45,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:01:45,448 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:01:45,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:01:45,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:01:45,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:01:45,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:01:45,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:01:45,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:01:45,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:01:45,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:01:45,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:01:45,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:01:45,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:01:45,480 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:01:45,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:01:45,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:01:45,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:01:45,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:45,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:45,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:01:45,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:01:45,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:01:45,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:01:45,484 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-01-10 01:01:45,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:01:45,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:01:45,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:01:45,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:01:45,721 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:01:45,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-01-10 01:01:46,875 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/672bb6adc/c2a1c10ab8b94a5aa6c6497b5d669a46/FLAG54c4bff63 [2025-01-10 01:01:47,198 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:01:47,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-01-10 01:01:47,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/672bb6adc/c2a1c10ab8b94a5aa6c6497b5d669a46/FLAG54c4bff63 [2025-01-10 01:01:47,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/672bb6adc/c2a1c10ab8b94a5aa6c6497b5d669a46 [2025-01-10 01:01:47,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:01:47,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:01:47,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:01:47,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:01:47,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:01:47,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d84384e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47, skipping insertion in model container [2025-01-10 01:01:47,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:01:47,604 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:01:47,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:01:47,618 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:01:47,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:01:47,655 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:01:47,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47 WrapperNode [2025-01-10 01:01:47,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:01:47,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:01:47,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:01:47,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:01:47,666 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:01:47" (1/1) ... [2025-01-10 01:01:47,672 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:01:47" (1/1) ... [2025-01-10 01:01:47,692 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 159 [2025-01-10 01:01:47,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:01:47,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:01:47,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:01:47,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:01:47,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,723 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:01:47,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:01:47,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:01:47,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:01:47,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:01:47,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (1/1) ... [2025-01-10 01:01:47,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:01:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:47,766 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:01:47,773 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:01:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:01:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:01:47,789 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:01:47,789 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:01:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:01:47,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:01:47,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:01:47,791 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:01:47,851 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:01:47,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:01:48,076 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:01:48,076 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:01:48,219 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:01:48,219 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:01:48,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:01:48 BoogieIcfgContainer [2025-01-10 01:01:48,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:01:48,221 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:01:48,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:01:48,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:01:48,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:01:47" (1/3) ... [2025-01-10 01:01:48,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ecada3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:01:48, skipping insertion in model container [2025-01-10 01:01:48,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:01:47" (2/3) ... [2025-01-10 01:01:48,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ecada3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:01:48, skipping insertion in model container [2025-01-10 01:01:48,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:01:48" (3/3) ... [2025-01-10 01:01:48,229 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-01-10 01:01:48,239 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:01:48,240 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 59 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-01-10 01:01:48,241 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:01:48,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 01:01:48,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 146 flow [2025-01-10 01:01:48,357 INFO L124 PetriNetUnfolderBase]: 8/64 cut-off events. [2025-01-10 01:01:48,362 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 01:01:48,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 8/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 194 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-01-10 01:01:48,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 66 transitions, 146 flow [2025-01-10 01:01:48,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 63 transitions, 138 flow [2025-01-10 01:01:48,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:01:48,386 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;@4338a33e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:01:48,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-01-10 01:01:48,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:01:48,390 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:01:48,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:01:48,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:48,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:01:48,392 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 505260, now seen corresponding path program 1 times [2025-01-10 01:01:48,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:48,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762949907] [2025-01-10 01:01:48,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:48,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:01:48,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:01:48,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:48,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,565 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:01:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762949907] [2025-01-10 01:01:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762949907] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:48,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:01:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319110820] [2025-01-10 01:01:48,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:48,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:01:48,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:48,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:01:48,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:01:48,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:01:48,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:01:48,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:48,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:01:48,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:48,748 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-01-10 01:01:48,748 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 01:01:48,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 384 events. 167/384 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1854 event pairs, 86 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 602. Up to 250 conditions per place. [2025-01-10 01:01:48,758 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 26 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2025-01-10 01:01:48,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 186 flow [2025-01-10 01:01:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:01:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:01:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-01-10 01:01:48,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6717171717171717 [2025-01-10 01:01:48,770 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 138 flow. Second operand 3 states and 133 transitions. [2025-01-10 01:01:48,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 186 flow [2025-01-10 01:01:48,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:01:48,777 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 126 flow [2025-01-10 01:01:48,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-01-10 01:01:48,780 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-01-10 01:01:48,780 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 126 flow [2025-01-10 01:01:48,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:01:48,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:48,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:01:48,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:01:48,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:48,781 INFO L85 PathProgramCache]: Analyzing trace with hash 505261, now seen corresponding path program 1 times [2025-01-10 01:01:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:48,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579428815] [2025-01-10 01:01:48,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:48,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:01:48,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:01:48,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:48,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:48,996 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:01:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579428815] [2025-01-10 01:01:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579428815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:01:48,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200056130] [2025-01-10 01:01:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:48,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:48,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:48,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:49,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:01:49,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:01:49,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:49,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:01:49,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:49,180 INFO L124 PetriNetUnfolderBase]: 167/388 cut-off events. [2025-01-10 01:01:49,180 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:01:49,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 388 events. 167/388 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1853 event pairs, 86 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 630. Up to 258 conditions per place. [2025-01-10 01:01:49,183 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 30 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-01-10 01:01:49,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 202 flow [2025-01-10 01:01:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:01:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:01:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-01-10 01:01:49,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7070707070707071 [2025-01-10 01:01:49,184 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 126 flow. Second operand 3 states and 140 transitions. [2025-01-10 01:01:49,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 202 flow [2025-01-10 01:01:49,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:49,186 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 148 flow [2025-01-10 01:01:49,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2025-01-10 01:01:49,186 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-01-10 01:01:49,187 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 148 flow [2025-01-10 01:01:49,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:01:49,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:49,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:01:49,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:01:49,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:49,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:49,187 INFO L85 PathProgramCache]: Analyzing trace with hash 485571933, now seen corresponding path program 1 times [2025-01-10 01:01:49,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617519073] [2025-01-10 01:01:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:49,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:49,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:01:49,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:01:49,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:49,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:49,393 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:01:49,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:49,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617519073] [2025-01-10 01:01:49,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617519073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:49,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535384749] [2025-01-10 01:01:49,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:49,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:49,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:49,397 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:01:49,398 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:01:49,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:01:49,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:01:49,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:49,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:49,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:01:49,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:49,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:01:49,530 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:01:49,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:49,585 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:01:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535384749] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:49,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:49,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-01-10 01:01:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923732933] [2025-01-10 01:01:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:01:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:49,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:01:49,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:01:49,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:01:49,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 148 flow. Second operand has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 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:01:49,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:49,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:01:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:49,968 INFO L124 PetriNetUnfolderBase]: 173/406 cut-off events. [2025-01-10 01:01:49,968 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:01:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 406 events. 173/406 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1918 event pairs, 86 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 665. Up to 261 conditions per place. [2025-01-10 01:01:49,970 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 36 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2025-01-10 01:01:49,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 319 flow [2025-01-10 01:01:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2025-01-10 01:01:49,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2025-01-10 01:01:49,972 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 148 flow. Second operand 6 states and 262 transitions. [2025-01-10 01:01:49,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 319 flow [2025-01-10 01:01:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:01:49,974 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 260 flow [2025-01-10 01:01:49,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-01-10 01:01:49,975 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 01:01:49,975 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 260 flow [2025-01-10 01:01:49,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 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:01:49,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:49,975 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-01-10 01:01:49,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 01:01:50,180 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:01:50,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1875299437, now seen corresponding path program 2 times [2025-01-10 01:01:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530551440] [2025-01-10 01:01:50,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:50,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:01:50,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:01:50,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:50,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530551440] [2025-01-10 01:01:50,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530551440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:50,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875796449] [2025-01-10 01:01:50,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:50,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:50,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:50,420 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:01:50,422 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:01:50,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-01-10 01:01:50,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:01:50,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:01:50,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:50,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 01:01:50,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:01:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:50,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:01:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875796449] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:50,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:50,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-01-10 01:01:50,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237121143] [2025-01-10 01:01:50,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:01:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:50,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:01:50,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:01:51,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:01:51,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 260 flow. Second operand has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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:01:51,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:51,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:01:51,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:51,786 INFO L124 PetriNetUnfolderBase]: 175/410 cut-off events. [2025-01-10 01:01:51,786 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 01:01:51,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 410 events. 175/410 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1955 event pairs, 86 based on Foata normal form. 4/294 useless extension candidates. Maximal degree in co-relation 684. Up to 254 conditions per place. [2025-01-10 01:01:51,788 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 31 selfloop transitions, 25 changer transitions 0/85 dead transitions. [2025-01-10 01:01:51,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 396 flow [2025-01-10 01:01:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:01:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:01:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2025-01-10 01:01:51,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2025-01-10 01:01:51,790 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 260 flow. Second operand 9 states and 366 transitions. [2025-01-10 01:01:51,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 396 flow [2025-01-10 01:01:51,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 332 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-01-10 01:01:51,793 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 266 flow [2025-01-10 01:01:51,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=266, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2025-01-10 01:01:51,793 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 01:01:51,793 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 266 flow [2025-01-10 01:01:51,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 35.833333333333336) internal successors, (645), 18 states have internal predecessors, (645), 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:01:51,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:51,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:51,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 01:01:51,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:51,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:51,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash -28434997, now seen corresponding path program 1 times [2025-01-10 01:01:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569168451] [2025-01-10 01:01:51,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:52,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:01:52,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:01:52,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569168451] [2025-01-10 01:01:52,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569168451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:52,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733267088] [2025-01-10 01:01:52,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:52,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:52,107 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:01:52,115 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:01:52,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:01:52,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:01:52,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:01:52,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:52,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:01:52,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733267088] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:52,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:52,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-10 01:01:52,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343478784] [2025-01-10 01:01:52,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:52,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 01:01:52,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:52,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 01:01:52,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:01:52,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-01-10 01:01:52,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 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:01:52,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:52,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-01-10 01:01:52,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:52,312 INFO L124 PetriNetUnfolderBase]: 169/404 cut-off events. [2025-01-10 01:01:52,312 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 01:01:52,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 404 events. 169/404 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1864 event pairs, 86 based on Foata normal form. 6/290 useless extension candidates. Maximal degree in co-relation 638. Up to 257 conditions per place. [2025-01-10 01:01:52,314 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 31 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2025-01-10 01:01:52,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 362 flow [2025-01-10 01:01:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-01-10 01:01:52,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 01:01:52,317 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 266 flow. Second operand 6 states and 264 transitions. [2025-01-10 01:01:52,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 362 flow [2025-01-10 01:01:52,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 325 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:52,319 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 256 flow [2025-01-10 01:01:52,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2025-01-10 01:01:52,319 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 01:01:52,319 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 256 flow [2025-01-10 01:01:52,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 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:01:52,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:52,319 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:52,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:01:52,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:52,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:52,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash 268457977, now seen corresponding path program 2 times [2025-01-10 01:01:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924256321] [2025-01-10 01:01:52,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:52,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-10 01:01:52,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-01-10 01:01:52,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:01:52,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-10 01:01:52,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:52,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924256321] [2025-01-10 01:01:52,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924256321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:52,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:01:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846476148] [2025-01-10 01:01:52,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:52,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:52,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:52,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:52,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-01-10 01:01:52,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:52,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:52,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-01-10 01:01:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:52,717 INFO L124 PetriNetUnfolderBase]: 240/532 cut-off events. [2025-01-10 01:01:52,717 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 01:01:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 532 events. 240/532 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2643 event pairs, 139 based on Foata normal form. 0/421 useless extension candidates. Maximal degree in co-relation 878. Up to 362 conditions per place. [2025-01-10 01:01:52,719 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 42 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2025-01-10 01:01:52,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 342 flow [2025-01-10 01:01:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:01:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:01:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-01-10 01:01:52,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-01-10 01:01:52,720 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 256 flow. Second operand 5 states and 170 transitions. [2025-01-10 01:01:52,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 342 flow [2025-01-10 01:01:52,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 325 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:52,721 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 241 flow [2025-01-10 01:01:52,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2025-01-10 01:01:52,722 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2025-01-10 01:01:52,722 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 241 flow [2025-01-10 01:01:52,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:52,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:52,722 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:01:52,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:52,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 268457978, now seen corresponding path program 1 times [2025-01-10 01:01:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447683193] [2025-01-10 01:01:52,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:52,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:01:52,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:01:52,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:01:52,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447683193] [2025-01-10 01:01:52,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447683193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004182199] [2025-01-10 01:01:52,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:52,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:52,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:52,840 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:01:52,841 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:01:52,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:01:52,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:01:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:52,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:01:52,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:01:52,970 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 01:01:53,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004182199] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:53,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:53,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 01:01:53,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435011371] [2025-01-10 01:01:53,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:01:53,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:53,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:01:53,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:01:53,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-01-10 01:01:53,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 241 flow. Second operand has 13 states, 13 states have (on average 38.15384615384615) internal successors, (496), 13 states have internal predecessors, (496), 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:01:53,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:53,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-01-10 01:01:53,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:53,155 INFO L124 PetriNetUnfolderBase]: 167/384 cut-off events. [2025-01-10 01:01:53,155 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:01:53,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 384 events. 167/384 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1664 event pairs, 86 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 616. Up to 254 conditions per place. [2025-01-10 01:01:53,156 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 32 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2025-01-10 01:01:53,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 348 flow [2025-01-10 01:01:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:01:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:01:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2025-01-10 01:01:53,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2025-01-10 01:01:53,158 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 241 flow. Second operand 8 states and 338 transitions. [2025-01-10 01:01:53,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 348 flow [2025-01-10 01:01:53,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 343 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:01:53,163 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 255 flow [2025-01-10 01:01:53,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2025-01-10 01:01:53,163 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 5 predicate places. [2025-01-10 01:01:53,163 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 67 transitions, 255 flow [2025-01-10 01:01:53,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 38.15384615384615) internal successors, (496), 13 states have internal predecessors, (496), 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:01:53,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:53,165 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:53,171 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:01:53,365 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,SelfDestructingSolverStorable6 [2025-01-10 01:01:53,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash 404636596, now seen corresponding path program 2 times [2025-01-10 01:01:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140900847] [2025-01-10 01:01:53,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:01:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:53,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-01-10 01:01:53,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 27 statements. [2025-01-10 01:01:53,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:01:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:01:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:53,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140900847] [2025-01-10 01:01:53,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140900847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:53,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:53,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547958328] [2025-01-10 01:01:53,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:53,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:01:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:53,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:01:53,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:01:53,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:01:53,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 67 transitions, 255 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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:01:53,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:53,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:01:53,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:53,665 INFO L124 PetriNetUnfolderBase]: 349/805 cut-off events. [2025-01-10 01:01:53,665 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 01:01:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 805 events. 349/805 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4217 event pairs, 112 based on Foata normal form. 26/613 useless extension candidates. Maximal degree in co-relation 1317. Up to 309 conditions per place. [2025-01-10 01:01:53,668 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 58 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-01-10 01:01:53,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 422 flow [2025-01-10 01:01:53,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-01-10 01:01:53,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-01-10 01:01:53,669 INFO L175 Difference]: Start difference. First operand has 67 places, 67 transitions, 255 flow. Second operand 6 states and 243 transitions. [2025-01-10 01:01:53,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 422 flow [2025-01-10 01:01:53,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 86 transitions, 390 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:01:53,670 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 243 flow [2025-01-10 01:01:53,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2025-01-10 01:01:53,671 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-01-10 01:01:53,671 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 243 flow [2025-01-10 01:01:53,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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:01:53,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:53,671 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:53,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:01:53,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:53,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -341166943, now seen corresponding path program 1 times [2025-01-10 01:01:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:53,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85658198] [2025-01-10 01:01:53,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:53,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:53,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:53,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:53,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:01:53,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85658198] [2025-01-10 01:01:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85658198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:53,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:53,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:01:53,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138481394] [2025-01-10 01:01:53,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:53,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:53,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:53,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:53,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:53,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 66 [2025-01-10 01:01:53,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:53,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:53,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 66 [2025-01-10 01:01:53,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:53,902 INFO L124 PetriNetUnfolderBase]: 447/902 cut-off events. [2025-01-10 01:01:53,902 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-01-10 01:01:53,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 902 events. 447/902 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4596 event pairs, 275 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 1667. Up to 677 conditions per place. [2025-01-10 01:01:53,906 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-01-10 01:01:53,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 327 flow [2025-01-10 01:01:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:01:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:01:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2025-01-10 01:01:53,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 01:01:53,907 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 243 flow. Second operand 4 states and 143 transitions. [2025-01-10 01:01:53,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 327 flow [2025-01-10 01:01:53,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 64 transitions, 319 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:01:53,909 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 231 flow [2025-01-10 01:01:53,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2025-01-10 01:01:53,910 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-01-10 01:01:53,910 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 231 flow [2025-01-10 01:01:53,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:01:53,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:53,911 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:53,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:01:53,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:53,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:53,911 INFO L85 PathProgramCache]: Analyzing trace with hash -341166942, now seen corresponding path program 1 times [2025-01-10 01:01:53,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852192940] [2025-01-10 01:01:53,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:53,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:53,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:53,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:53,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:01:54,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852192940] [2025-01-10 01:01:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852192940] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168267473] [2025-01-10 01:01:54,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:54,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:54,141 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:01:54,142 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:01:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 01:01:54,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 01:01:54,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:54,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:54,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:01:54,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:54,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:54,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:01:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168267473] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:54,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-01-10 01:01:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865561545] [2025-01-10 01:01:54,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:01:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:01:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:01:55,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:01:55,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 231 flow. Second operand has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 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:01:55,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:55,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:01:55,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:55,662 INFO L124 PetriNetUnfolderBase]: 409/897 cut-off events. [2025-01-10 01:01:55,663 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-10 01:01:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 897 events. 409/897 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4532 event pairs, 62 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1581. Up to 246 conditions per place. [2025-01-10 01:01:55,666 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 70 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-01-10 01:01:55,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 103 transitions, 497 flow [2025-01-10 01:01:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:01:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:01:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 415 transitions. [2025-01-10 01:01:55,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287878787878788 [2025-01-10 01:01:55,668 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 231 flow. Second operand 10 states and 415 transitions. [2025-01-10 01:01:55,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 103 transitions, 497 flow [2025-01-10 01:01:55,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 103 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:01:55,669 INFO L231 Difference]: Finished difference. Result has 70 places, 64 transitions, 273 flow [2025-01-10 01:01:55,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2025-01-10 01:01:55,670 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-01-10 01:01:55,670 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 273 flow [2025-01-10 01:01:55,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.904761904761905) internal successors, (733), 21 states have internal predecessors, (733), 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:01:55,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:55,670 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:55,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 01:01:55,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:01:55,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:55,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2024653679, now seen corresponding path program 1 times [2025-01-10 01:01:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:55,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763893842] [2025-01-10 01:01:55,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:55,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:01:55,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:01:55,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:55,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:01:56,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763893842] [2025-01-10 01:01:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763893842] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232228728] [2025-01-10 01:01:56,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:56,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:56,048 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:01:56,053 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:01:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:01:56,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:01:56,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:56,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:01:56,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:56,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:56,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-01-10 01:01:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232228728] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:01:56,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:01:56,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-01-10 01:01:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850541243] [2025-01-10 01:01:56,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:01:56,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:01:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:56,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:01:56,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:01:56,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:01:56,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 273 flow. Second operand has 21 states, 21 states have (on average 34.19047619047619) internal successors, (718), 21 states have internal predecessors, (718), 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:01:56,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:56,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:01:56,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:57,309 INFO L124 PetriNetUnfolderBase]: 916/1942 cut-off events. [2025-01-10 01:01:57,309 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2025-01-10 01:01:57,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3841 conditions, 1942 events. 916/1942 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11473 event pairs, 152 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 3723. Up to 553 conditions per place. [2025-01-10 01:01:57,316 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 71 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2025-01-10 01:01:57,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 103 transitions, 575 flow [2025-01-10 01:01:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:01:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:01:57,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 403 transitions. [2025-01-10 01:01:57,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6106060606060606 [2025-01-10 01:01:57,318 INFO L175 Difference]: Start difference. First operand has 70 places, 64 transitions, 273 flow. Second operand 10 states and 403 transitions. [2025-01-10 01:01:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 103 transitions, 575 flow [2025-01-10 01:01:57,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 548 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 01:01:57,320 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 297 flow [2025-01-10 01:01:57,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=297, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 01:01:57,321 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-01-10 01:01:57,321 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 297 flow [2025-01-10 01:01:57,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 34.19047619047619) internal successors, (718), 21 states have internal predecessors, (718), 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:01:57,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:57,321 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:57,327 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:01:57,525 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,SelfDestructingSolverStorable10 [2025-01-10 01:01:57,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:57,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1660245882, now seen corresponding path program 1 times [2025-01-10 01:01:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173141472] [2025-01-10 01:01:57,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:57,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:01:57,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:01:57,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:57,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:01:57,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173141472] [2025-01-10 01:01:57,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173141472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:57,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836191906] [2025-01-10 01:01:57,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:57,758 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:01:57,760 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:01:57,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:01:57,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:01:57,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:57,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:57,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 01:01:57,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:01:57,848 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:01:57,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:01:57,912 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:01:57,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:01:57,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:01:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:58,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:01:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:01:58,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836191906] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:58,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:01:58,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 21 [2025-01-10 01:01:58,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335566945] [2025-01-10 01:01:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:58,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:01:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:58,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:01:58,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:01:58,940 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:01:58,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 297 flow. Second operand has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 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:01:58,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:58,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:01:58,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:59,152 INFO L124 PetriNetUnfolderBase]: 866/1834 cut-off events. [2025-01-10 01:01:59,152 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2025-01-10 01:01:59,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 1834 events. 866/1834 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10894 event pairs, 232 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 3791. Up to 870 conditions per place. [2025-01-10 01:01:59,163 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 53 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2025-01-10 01:01:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 461 flow [2025-01-10 01:01:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:01:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:01:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 243 transitions. [2025-01-10 01:01:59,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-01-10 01:01:59,165 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 297 flow. Second operand 6 states and 243 transitions. [2025-01-10 01:01:59,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 461 flow [2025-01-10 01:01:59,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 440 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:01:59,167 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 303 flow [2025-01-10 01:01:59,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-01-10 01:01:59,170 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 12 predicate places. [2025-01-10 01:01:59,170 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 303 flow [2025-01-10 01:01:59,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.0) internal successors, (350), 10 states have internal predecessors, (350), 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:01:59,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:59,171 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:59,177 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:01:59,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:59,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:59,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1174439330, now seen corresponding path program 1 times [2025-01-10 01:01:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933783117] [2025-01-10 01:01:59,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:59,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:01:59,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:01:59,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:59,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:01:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:59,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933783117] [2025-01-10 01:01:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933783117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:01:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:01:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:01:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569875164] [2025-01-10 01:01:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:01:59,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:01:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:01:59,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:01:59,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:01:59,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-01-10 01:01:59,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:01:59,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:01:59,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-01-10 01:01:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:01:59,778 INFO L124 PetriNetUnfolderBase]: 1159/2540 cut-off events. [2025-01-10 01:01:59,778 INFO L125 PetriNetUnfolderBase]: For 1855/1855 co-relation queries the response was YES. [2025-01-10 01:01:59,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5671 conditions, 2540 events. 1159/2540 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 16532 event pairs, 503 based on Foata normal form. 60/2441 useless extension candidates. Maximal degree in co-relation 5556. Up to 1132 conditions per place. [2025-01-10 01:01:59,788 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 70 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-01-10 01:01:59,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 555 flow [2025-01-10 01:01:59,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:01:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:01:59,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-01-10 01:01:59,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7537878787878788 [2025-01-10 01:01:59,789 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 303 flow. Second operand 4 states and 199 transitions. [2025-01-10 01:01:59,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 555 flow [2025-01-10 01:01:59,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 93 transitions, 540 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 01:01:59,792 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 309 flow [2025-01-10 01:01:59,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2025-01-10 01:01:59,792 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2025-01-10 01:01:59,792 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 309 flow [2025-01-10 01:01:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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:01:59,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:01:59,793 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:01:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:01:59,793 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:01:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:01:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -33695357, now seen corresponding path program 1 times [2025-01-10 01:01:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:01:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028330635] [2025-01-10 01:01:59,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:01:59,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:01:59,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:01:59,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:01:59,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:01:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:01:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:01:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028330635] [2025-01-10 01:01:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028330635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:01:59,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502758925] [2025-01-10 01:01:59,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:01:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:01:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:01:59,984 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:01:59,985 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:02:00,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 01:02:00,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:02:00,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:00,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:00,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:02:00,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:00,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:02:00,084 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:02:00,140 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:02:00,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:02:00,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:02:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:00,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:00,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502758925] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:00,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:00,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-01-10 01:02:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447600067] [2025-01-10 01:02:00,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:00,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:02:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:00,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:02:00,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:02:01,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2025-01-10 01:02:01,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 309 flow. Second operand has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 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:02:01,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:01,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2025-01-10 01:02:01,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:02,556 INFO L124 PetriNetUnfolderBase]: 2541/4950 cut-off events. [2025-01-10 01:02:02,557 INFO L125 PetriNetUnfolderBase]: For 3830/3830 co-relation queries the response was YES. [2025-01-10 01:02:02,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11893 conditions, 4950 events. 2541/4950 cut-off events. For 3830/3830 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 31366 event pairs, 161 based on Foata normal form. 180/4954 useless extension candidates. Maximal degree in co-relation 11778. Up to 1078 conditions per place. [2025-01-10 01:02:02,575 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 122 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2025-01-10 01:02:02,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 152 transitions, 894 flow [2025-01-10 01:02:02,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:02:02,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:02:02,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2025-01-10 01:02:02,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5979020979020979 [2025-01-10 01:02:02,576 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 309 flow. Second operand 13 states and 513 transitions. [2025-01-10 01:02:02,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 152 transitions, 894 flow [2025-01-10 01:02:02,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 152 transitions, 884 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:02:02,584 INFO L231 Difference]: Finished difference. Result has 89 places, 68 transitions, 365 flow [2025-01-10 01:02:02,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=365, PETRI_PLACES=89, PETRI_TRANSITIONS=68} [2025-01-10 01:02:02,585 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 27 predicate places. [2025-01-10 01:02:02,585 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 68 transitions, 365 flow [2025-01-10 01:02:02,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 32.46153846153846) internal successors, (844), 26 states have internal predecessors, (844), 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:02:02,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:02,585 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:02,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 01:02:02,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:02,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:02,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1948481615, now seen corresponding path program 1 times [2025-01-10 01:02:02,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:02,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041313785] [2025-01-10 01:02:02,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:02,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-10 01:02:02,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-10 01:02:02,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:02,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:02,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:02,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041313785] [2025-01-10 01:02:02,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041313785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:02,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:02,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:02,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933334156] [2025-01-10 01:02:02,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:02,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:02,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:02,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:02,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:02,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-01-10 01:02:02,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 68 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:02,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:02,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-01-10 01:02:02,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:03,259 INFO L124 PetriNetUnfolderBase]: 3217/6764 cut-off events. [2025-01-10 01:02:03,259 INFO L125 PetriNetUnfolderBase]: For 6442/6442 co-relation queries the response was YES. [2025-01-10 01:02:03,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16069 conditions, 6764 events. 3217/6764 cut-off events. For 6442/6442 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 50840 event pairs, 1802 based on Foata normal form. 186/6652 useless extension candidates. Maximal degree in co-relation 15944. Up to 3484 conditions per place. [2025-01-10 01:02:03,285 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 76 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-01-10 01:02:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 99 transitions, 698 flow [2025-01-10 01:02:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:02:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:02:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 01:02:03,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7424242424242424 [2025-01-10 01:02:03,286 INFO L175 Difference]: Start difference. First operand has 89 places, 68 transitions, 365 flow. Second operand 4 states and 196 transitions. [2025-01-10 01:02:03,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 99 transitions, 698 flow [2025-01-10 01:02:03,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 99 transitions, 689 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:03,293 INFO L231 Difference]: Finished difference. Result has 91 places, 69 transitions, 375 flow [2025-01-10 01:02:03,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=91, PETRI_TRANSITIONS=69} [2025-01-10 01:02:03,293 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 29 predicate places. [2025-01-10 01:02:03,293 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 69 transitions, 375 flow [2025-01-10 01:02:03,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:03,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:03,293 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:02:03,293 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:03,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1765422937, now seen corresponding path program 1 times [2025-01-10 01:02:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134528397] [2025-01-10 01:02:03,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:03,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:02:03,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:02:03,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:03,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134528397] [2025-01-10 01:02:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134528397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:03,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188334910] [2025-01-10 01:02:03,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:03,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:03,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:03,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:03,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:03,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 69 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:02:03,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:03,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:03,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:03,993 INFO L124 PetriNetUnfolderBase]: 3952/8171 cut-off events. [2025-01-10 01:02:03,993 INFO L125 PetriNetUnfolderBase]: For 8306/8306 co-relation queries the response was YES. [2025-01-10 01:02:04,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20499 conditions, 8171 events. 3952/8171 cut-off events. For 8306/8306 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 61274 event pairs, 2242 based on Foata normal form. 5/7720 useless extension candidates. Maximal degree in co-relation 20373. Up to 5093 conditions per place. [2025-01-10 01:02:04,068 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 81 selfloop transitions, 5 changer transitions 2/107 dead transitions. [2025-01-10 01:02:04,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 107 transitions, 702 flow [2025-01-10 01:02:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:02:04,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:02:04,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2025-01-10 01:02:04,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2025-01-10 01:02:04,072 INFO L175 Difference]: Start difference. First operand has 91 places, 69 transitions, 375 flow. Second operand 5 states and 235 transitions. [2025-01-10 01:02:04,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 107 transitions, 702 flow [2025-01-10 01:02:04,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 107 transitions, 699 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:02:04,095 INFO L231 Difference]: Finished difference. Result has 96 places, 70 transitions, 394 flow [2025-01-10 01:02:04,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=394, PETRI_PLACES=96, PETRI_TRANSITIONS=70} [2025-01-10 01:02:04,096 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2025-01-10 01:02:04,096 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 70 transitions, 394 flow [2025-01-10 01:02:04,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:02:04,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:04,096 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:04,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:02:04,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:04,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1532248499, now seen corresponding path program 2 times [2025-01-10 01:02:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124278349] [2025-01-10 01:02:04,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:04,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:02:04,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-01-10 01:02:04,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:02:04,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124278349] [2025-01-10 01:02:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124278349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:02:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190200168] [2025-01-10 01:02:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:02:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:04,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:02:04,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:02:04,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2025-01-10 01:02:04,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 70 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:02:04,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:04,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2025-01-10 01:02:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:04,659 INFO L124 PetriNetUnfolderBase]: 3363/6940 cut-off events. [2025-01-10 01:02:04,659 INFO L125 PetriNetUnfolderBase]: For 8772/8772 co-relation queries the response was YES. [2025-01-10 01:02:04,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18000 conditions, 6940 events. 3363/6940 cut-off events. For 8772/8772 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 52762 event pairs, 1398 based on Foata normal form. 15/6731 useless extension candidates. Maximal degree in co-relation 17871. Up to 3477 conditions per place. [2025-01-10 01:02:04,687 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 69 selfloop transitions, 3 changer transitions 1/95 dead transitions. [2025-01-10 01:02:04,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 95 transitions, 688 flow [2025-01-10 01:02:04,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:02:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:02:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 01:02:04,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2025-01-10 01:02:04,692 INFO L175 Difference]: Start difference. First operand has 96 places, 70 transitions, 394 flow. Second operand 3 states and 156 transitions. [2025-01-10 01:02:04,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 95 transitions, 688 flow [2025-01-10 01:02:04,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 676 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:04,701 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 405 flow [2025-01-10 01:02:04,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2025-01-10 01:02:04,701 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2025-01-10 01:02:04,701 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 405 flow [2025-01-10 01:02:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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:02:04,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:04,701 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:04,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:02:04,702 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash -270028182, now seen corresponding path program 1 times [2025-01-10 01:02:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:04,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056880834] [2025-01-10 01:02:04,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:04,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:02:04,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:02:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-10 01:02:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056880834] [2025-01-10 01:02:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056880834] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975396355] [2025-01-10 01:02:04,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:04,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:04,956 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:02:04,956 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:02:05,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 01:02:05,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 01:02:05,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:05,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-10 01:02:05,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:05,110 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:02:05,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-10 01:02:05,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:02:05,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-10 01:02:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-10 01:02:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:05,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975396355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:05,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2025-01-10 01:02:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555242395] [2025-01-10 01:02:05,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:05,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-10 01:02:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:05,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-10 01:02:05,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-01-10 01:02:07,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 66 [2025-01-10 01:02:07,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 405 flow. Second operand has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 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:02:07,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:07,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 66 [2025-01-10 01:02:07,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:08,723 INFO L124 PetriNetUnfolderBase]: 6766/14349 cut-off events. [2025-01-10 01:02:08,723 INFO L125 PetriNetUnfolderBase]: For 15638/15638 co-relation queries the response was YES. [2025-01-10 01:02:08,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38667 conditions, 14349 events. 6766/14349 cut-off events. For 15638/15638 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 118268 event pairs, 573 based on Foata normal form. 297/14206 useless extension candidates. Maximal degree in co-relation 38537. Up to 2783 conditions per place. [2025-01-10 01:02:08,816 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 133 selfloop transitions, 13 changer transitions 0/165 dead transitions. [2025-01-10 01:02:08,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 165 transitions, 1213 flow [2025-01-10 01:02:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:02:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:02:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 511 transitions. [2025-01-10 01:02:08,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5955710955710956 [2025-01-10 01:02:08,821 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 405 flow. Second operand 13 states and 511 transitions. [2025-01-10 01:02:08,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 165 transitions, 1213 flow [2025-01-10 01:02:08,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 165 transitions, 1203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:02:08,848 INFO L231 Difference]: Finished difference. Result has 111 places, 75 transitions, 474 flow [2025-01-10 01:02:08,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=474, PETRI_PLACES=111, PETRI_TRANSITIONS=75} [2025-01-10 01:02:08,849 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 49 predicate places. [2025-01-10 01:02:08,849 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 75 transitions, 474 flow [2025-01-10 01:02:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 33.57692307692308) internal successors, (873), 26 states have internal predecessors, (873), 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:02:08,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:08,850 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:08,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 01:02:09,050 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:02:09,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:09,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1051501116, now seen corresponding path program 1 times [2025-01-10 01:02:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:09,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948362008] [2025-01-10 01:02:09,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:02:09,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:02:09,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:09,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948362008] [2025-01-10 01:02:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948362008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:09,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:09,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084301091] [2025-01-10 01:02:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:09,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:09,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:09,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:09,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:09,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 75 transitions, 474 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:09,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:09,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:09,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:10,447 INFO L124 PetriNetUnfolderBase]: 7575/16587 cut-off events. [2025-01-10 01:02:10,448 INFO L125 PetriNetUnfolderBase]: For 24103/24103 co-relation queries the response was YES. [2025-01-10 01:02:10,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45193 conditions, 16587 events. 7575/16587 cut-off events. For 24103/24103 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 138487 event pairs, 3641 based on Foata normal form. 84/16240 useless extension candidates. Maximal degree in co-relation 45053. Up to 9772 conditions per place. [2025-01-10 01:02:10,527 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 96 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-01-10 01:02:10,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 120 transitions, 934 flow [2025-01-10 01:02:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:02:10,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:02:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 01:02:10,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7689393939393939 [2025-01-10 01:02:10,530 INFO L175 Difference]: Start difference. First operand has 111 places, 75 transitions, 474 flow. Second operand 4 states and 203 transitions. [2025-01-10 01:02:10,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 120 transitions, 934 flow [2025-01-10 01:02:10,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 120 transitions, 915 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:02:10,588 INFO L231 Difference]: Finished difference. Result has 108 places, 77 transitions, 494 flow [2025-01-10 01:02:10,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=108, PETRI_TRANSITIONS=77} [2025-01-10 01:02:10,589 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 46 predicate places. [2025-01-10 01:02:10,589 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 77 transitions, 494 flow [2025-01-10 01:02:10,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:10,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:10,589 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:10,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:02:10,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:10,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:10,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1596267750, now seen corresponding path program 2 times [2025-01-10 01:02:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:10,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592440971] [2025-01-10 01:02:10,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:10,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:02:10,606 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-01-10 01:02:10,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:02:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592440971] [2025-01-10 01:02:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592440971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747920240] [2025-01-10 01:02:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:10,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:10,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:10,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:10,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:10,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 77 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:10,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:10,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:10,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:12,247 INFO L124 PetriNetUnfolderBase]: 8521/18167 cut-off events. [2025-01-10 01:02:12,247 INFO L125 PetriNetUnfolderBase]: For 28255/28255 co-relation queries the response was YES. [2025-01-10 01:02:12,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51090 conditions, 18167 events. 8521/18167 cut-off events. For 28255/28255 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 156990 event pairs, 4215 based on Foata normal form. 84/17748 useless extension candidates. Maximal degree in co-relation 50954. Up to 12155 conditions per place. [2025-01-10 01:02:12,353 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 80 selfloop transitions, 5 changer transitions 3/108 dead transitions. [2025-01-10 01:02:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 853 flow [2025-01-10 01:02:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:02:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:02:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2025-01-10 01:02:12,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2025-01-10 01:02:12,355 INFO L175 Difference]: Start difference. First operand has 108 places, 77 transitions, 494 flow. Second operand 4 states and 193 transitions. [2025-01-10 01:02:12,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 853 flow [2025-01-10 01:02:12,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 845 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-10 01:02:12,402 INFO L231 Difference]: Finished difference. Result has 113 places, 80 transitions, 555 flow [2025-01-10 01:02:12,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=113, PETRI_TRANSITIONS=80} [2025-01-10 01:02:12,403 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 51 predicate places. [2025-01-10 01:02:12,403 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 80 transitions, 555 flow [2025-01-10 01:02:12,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:12,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:12,403 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:12,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:02:12,403 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:12,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:12,404 INFO L85 PathProgramCache]: Analyzing trace with hash 905856108, now seen corresponding path program 1 times [2025-01-10 01:02:12,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:12,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381002886] [2025-01-10 01:02:12,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:12,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:12,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 01:02:12,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 01:02:12,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:12,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:12,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:12,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381002886] [2025-01-10 01:02:12,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381002886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:12,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:12,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644458308] [2025-01-10 01:02:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:12,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:12,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:12,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:12,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:12,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 80 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:12,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:12,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:12,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:14,590 INFO L124 PetriNetUnfolderBase]: 9934/20917 cut-off events. [2025-01-10 01:02:14,590 INFO L125 PetriNetUnfolderBase]: For 33674/33674 co-relation queries the response was YES. [2025-01-10 01:02:14,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58541 conditions, 20917 events. 9934/20917 cut-off events. For 33674/33674 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 184520 event pairs, 4839 based on Foata normal form. 0/20206 useless extension candidates. Maximal degree in co-relation 58403. Up to 14592 conditions per place. [2025-01-10 01:02:14,751 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 83 selfloop transitions, 6 changer transitions 0/111 dead transitions. [2025-01-10 01:02:14,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 111 transitions, 893 flow [2025-01-10 01:02:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:02:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:02:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2025-01-10 01:02:14,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-01-10 01:02:14,756 INFO L175 Difference]: Start difference. First operand has 113 places, 80 transitions, 555 flow. Second operand 4 states and 192 transitions. [2025-01-10 01:02:14,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 111 transitions, 893 flow [2025-01-10 01:02:14,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 879 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:14,829 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 600 flow [2025-01-10 01:02:14,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=600, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2025-01-10 01:02:14,830 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 52 predicate places. [2025-01-10 01:02:14,833 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 600 flow [2025-01-10 01:02:14,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:14,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:14,833 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:14,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:02:14,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:14,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1807256396, now seen corresponding path program 2 times [2025-01-10 01:02:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:14,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958538898] [2025-01-10 01:02:14,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:14,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:14,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-10 01:02:14,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-01-10 01:02:14,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:02:14,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:14,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958538898] [2025-01-10 01:02:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958538898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:14,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:14,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457888417] [2025-01-10 01:02:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:14,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:14,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:14,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:14,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:14,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 600 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:14,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:14,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:14,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:16,766 INFO L124 PetriNetUnfolderBase]: 9966/20953 cut-off events. [2025-01-10 01:02:16,767 INFO L125 PetriNetUnfolderBase]: For 36655/36657 co-relation queries the response was YES. [2025-01-10 01:02:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59994 conditions, 20953 events. 9966/20953 cut-off events. For 36655/36657 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 182820 event pairs, 7043 based on Foata normal form. 5/20812 useless extension candidates. Maximal degree in co-relation 59856. Up to 12023 conditions per place. [2025-01-10 01:02:16,887 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 94 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-01-10 01:02:16,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 124 transitions, 1047 flow [2025-01-10 01:02:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:02:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:02:16,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 231 transitions. [2025-01-10 01:02:16,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-01-10 01:02:16,888 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 600 flow. Second operand 5 states and 231 transitions. [2025-01-10 01:02:16,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 124 transitions, 1047 flow [2025-01-10 01:02:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 124 transitions, 1047 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:02:16,935 INFO L231 Difference]: Finished difference. Result has 120 places, 84 transitions, 631 flow [2025-01-10 01:02:16,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=631, PETRI_PLACES=120, PETRI_TRANSITIONS=84} [2025-01-10 01:02:16,936 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 58 predicate places. [2025-01-10 01:02:16,936 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 84 transitions, 631 flow [2025-01-10 01:02:16,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:16,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:16,936 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:16,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:02:16,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:16,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1557708912, now seen corresponding path program 3 times [2025-01-10 01:02:16,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:16,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960083468] [2025-01-10 01:02:16,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:02:16,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:16,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 6 equivalence classes. [2025-01-10 01:02:16,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 42 statements. [2025-01-10 01:02:16,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:02:16,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:16,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:16,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960083468] [2025-01-10 01:02:16,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960083468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:16,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:02:16,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145313370] [2025-01-10 01:02:16,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:16,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:02:16,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:16,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:02:16,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:02:16,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2025-01-10 01:02:16,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 84 transitions, 631 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:16,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:16,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2025-01-10 01:02:16,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:19,095 INFO L124 PetriNetUnfolderBase]: 9700/20477 cut-off events. [2025-01-10 01:02:19,095 INFO L125 PetriNetUnfolderBase]: For 40628/40630 co-relation queries the response was YES. [2025-01-10 01:02:19,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59745 conditions, 20477 events. 9700/20477 cut-off events. For 40628/40630 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 178247 event pairs, 6967 based on Foata normal form. 95/20449 useless extension candidates. Maximal degree in co-relation 59603. Up to 12049 conditions per place. [2025-01-10 01:02:19,254 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 91 selfloop transitions, 8 changer transitions 2/123 dead transitions. [2025-01-10 01:02:19,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 1067 flow [2025-01-10 01:02:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:02:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:02:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-01-10 01:02:19,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7462121212121212 [2025-01-10 01:02:19,256 INFO L175 Difference]: Start difference. First operand has 120 places, 84 transitions, 631 flow. Second operand 4 states and 197 transitions. [2025-01-10 01:02:19,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 1067 flow [2025-01-10 01:02:19,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 123 transitions, 1051 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:19,305 INFO L231 Difference]: Finished difference. Result has 121 places, 84 transitions, 635 flow [2025-01-10 01:02:19,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=635, PETRI_PLACES=121, PETRI_TRANSITIONS=84} [2025-01-10 01:02:19,305 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 59 predicate places. [2025-01-10 01:02:19,305 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 84 transitions, 635 flow [2025-01-10 01:02:19,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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:02:19,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:19,306 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:19,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:02:19,306 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:19,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1291312068, now seen corresponding path program 1 times [2025-01-10 01:02:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:19,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250328432] [2025-01-10 01:02:19,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:19,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:19,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 01:02:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:02:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:02:19,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250328432] [2025-01-10 01:02:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250328432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302866254] [2025-01-10 01:02:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:19,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:19,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:19,646 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:02:19,648 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:02:19,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 01:02:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 01:02:19,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:19,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:19,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:02:19,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:19,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:20,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:02:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:20,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302866254] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:20,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:20,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-01-10 01:02:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668656808] [2025-01-10 01:02:20,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:20,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:02:20,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:20,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:02:20,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:02:21,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2025-01-10 01:02:21,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 84 transitions, 635 flow. Second operand has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 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:02:21,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:21,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2025-01-10 01:02:21,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:23,558 INFO L124 PetriNetUnfolderBase]: 10791/22640 cut-off events. [2025-01-10 01:02:23,558 INFO L125 PetriNetUnfolderBase]: For 48181/48182 co-relation queries the response was YES. [2025-01-10 01:02:23,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65848 conditions, 22640 events. 10791/22640 cut-off events. For 48181/48182 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 197972 event pairs, 1319 based on Foata normal form. 318/22860 useless extension candidates. Maximal degree in co-relation 65706. Up to 4655 conditions per place. [2025-01-10 01:02:23,779 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 174 selfloop transitions, 21 changer transitions 0/218 dead transitions. [2025-01-10 01:02:23,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 218 transitions, 1920 flow [2025-01-10 01:02:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:02:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:02:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 573 transitions. [2025-01-10 01:02:23,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6678321678321678 [2025-01-10 01:02:23,781 INFO L175 Difference]: Start difference. First operand has 121 places, 84 transitions, 635 flow. Second operand 13 states and 573 transitions. [2025-01-10 01:02:23,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 218 transitions, 1920 flow [2025-01-10 01:02:23,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 218 transitions, 1878 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 01:02:23,839 INFO L231 Difference]: Finished difference. Result has 133 places, 86 transitions, 704 flow [2025-01-10 01:02:23,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=704, PETRI_PLACES=133, PETRI_TRANSITIONS=86} [2025-01-10 01:02:23,840 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 71 predicate places. [2025-01-10 01:02:23,840 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 86 transitions, 704 flow [2025-01-10 01:02:23,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 35.32142857142857) internal successors, (989), 28 states have internal predecessors, (989), 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:02:23,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:23,840 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:23,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 01:02:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-10 01:02:24,041 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1042335055, now seen corresponding path program 1 times [2025-01-10 01:02:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382103301] [2025-01-10 01:02:24,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:02:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:02:24,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:24,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-10 01:02:24,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382103301] [2025-01-10 01:02:24,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382103301] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:24,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166123624] [2025-01-10 01:02:24,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:24,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:24,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:24,286 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:02:24,291 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:02:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-10 01:02:24,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-10 01:02:24,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:24,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:02:24,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:24,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:02:24,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:02:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:02:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166123624] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:02:24,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:02:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 27 [2025-01-10 01:02:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903518076] [2025-01-10 01:02:24,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:02:24,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 01:02:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:24,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 01:02:24,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2025-01-10 01:02:26,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:26,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 86 transitions, 704 flow. Second operand has 28 states, 28 states have (on average 34.75) internal successors, (973), 28 states have internal predecessors, (973), 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:02:26,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:26,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:26,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:29,896 INFO L124 PetriNetUnfolderBase]: 14171/29142 cut-off events. [2025-01-10 01:02:29,897 INFO L125 PetriNetUnfolderBase]: For 67228/67230 co-relation queries the response was YES. [2025-01-10 01:02:30,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86271 conditions, 29142 events. 14171/29142 cut-off events. For 67228/67230 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 254321 event pairs, 2270 based on Foata normal form. 425/29519 useless extension candidates. Maximal degree in co-relation 86116. Up to 6261 conditions per place. [2025-01-10 01:02:30,238 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 175 selfloop transitions, 21 changer transitions 0/219 dead transitions. [2025-01-10 01:02:30,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 219 transitions, 2042 flow [2025-01-10 01:02:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:02:30,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:02:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 555 transitions. [2025-01-10 01:02:30,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6468531468531469 [2025-01-10 01:02:30,239 INFO L175 Difference]: Start difference. First operand has 133 places, 86 transitions, 704 flow. Second operand 13 states and 555 transitions. [2025-01-10 01:02:30,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 219 transitions, 2042 flow [2025-01-10 01:02:30,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 219 transitions, 1971 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 01:02:30,327 INFO L231 Difference]: Finished difference. Result has 140 places, 88 transitions, 757 flow [2025-01-10 01:02:30,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=757, PETRI_PLACES=140, PETRI_TRANSITIONS=88} [2025-01-10 01:02:30,328 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 78 predicate places. [2025-01-10 01:02:30,328 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 88 transitions, 757 flow [2025-01-10 01:02:30,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 34.75) internal successors, (973), 28 states have internal predecessors, (973), 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:02:30,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:30,329 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:30,335 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:02:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 01:02:30,533 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1335323909, now seen corresponding path program 1 times [2025-01-10 01:02:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907699921] [2025-01-10 01:02:30,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:02:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:30,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 01:02:30,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:02:30,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:02:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:30,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:30,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907699921] [2025-01-10 01:02:30,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907699921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:30,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:30,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:02:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882001719] [2025-01-10 01:02:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:30,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:02:30,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:30,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:02:30,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:02:31,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:31,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 88 transitions, 757 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:31,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:31,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:31,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:34,527 INFO L124 PetriNetUnfolderBase]: 16951/33986 cut-off events. [2025-01-10 01:02:34,527 INFO L125 PetriNetUnfolderBase]: For 90527/90712 co-relation queries the response was YES. [2025-01-10 01:02:34,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104686 conditions, 33986 events. 16951/33986 cut-off events. For 90527/90712 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 290469 event pairs, 12143 based on Foata normal form. 9/33963 useless extension candidates. Maximal degree in co-relation 104527. Up to 21596 conditions per place. [2025-01-10 01:02:34,965 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 212 selfloop transitions, 25 changer transitions 0/254 dead transitions. [2025-01-10 01:02:34,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 254 transitions, 2483 flow [2025-01-10 01:02:34,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:02:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-10 01:02:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 625 transitions. [2025-01-10 01:02:34,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6313131313131313 [2025-01-10 01:02:34,966 INFO L175 Difference]: Start difference. First operand has 140 places, 88 transitions, 757 flow. Second operand 15 states and 625 transitions. [2025-01-10 01:02:34,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 254 transitions, 2483 flow [2025-01-10 01:02:35,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 254 transitions, 2408 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-01-10 01:02:35,106 INFO L231 Difference]: Finished difference. Result has 156 places, 106 transitions, 993 flow [2025-01-10 01:02:35,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=993, PETRI_PLACES=156, PETRI_TRANSITIONS=106} [2025-01-10 01:02:35,106 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 94 predicate places. [2025-01-10 01:02:35,106 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 106 transitions, 993 flow [2025-01-10 01:02:35,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:35,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:35,107 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:35,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:02:35,107 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:35,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -42339665, now seen corresponding path program 2 times [2025-01-10 01:02:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:35,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515450213] [2025-01-10 01:02:35,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:02:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:35,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-10 01:02:35,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-01-10 01:02:35,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:02:35,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515450213] [2025-01-10 01:02:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515450213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:35,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:02:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531548912] [2025-01-10 01:02:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:02:35,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:35,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:02:35,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:02:35,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:35,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 106 transitions, 993 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:35,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:35,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:35,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:40,332 INFO L124 PetriNetUnfolderBase]: 16981/34215 cut-off events. [2025-01-10 01:02:40,332 INFO L125 PetriNetUnfolderBase]: For 118112/118165 co-relation queries the response was YES. [2025-01-10 01:02:40,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116649 conditions, 34215 events. 16981/34215 cut-off events. For 118112/118165 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 291587 event pairs, 13546 based on Foata normal form. 8/34182 useless extension candidates. Maximal degree in co-relation 116488. Up to 21596 conditions per place. [2025-01-10 01:02:40,694 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 170 selfloop transitions, 38 changer transitions 0/225 dead transitions. [2025-01-10 01:02:40,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 225 transitions, 2167 flow [2025-01-10 01:02:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:02:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:02:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 586 transitions. [2025-01-10 01:02:40,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341991341991342 [2025-01-10 01:02:40,696 INFO L175 Difference]: Start difference. First operand has 156 places, 106 transitions, 993 flow. Second operand 14 states and 586 transitions. [2025-01-10 01:02:40,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 225 transitions, 2167 flow [2025-01-10 01:02:41,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 225 transitions, 2082 flow, removed 41 selfloop flow, removed 2 redundant places. [2025-01-10 01:02:41,082 INFO L231 Difference]: Finished difference. Result has 177 places, 127 transitions, 1340 flow [2025-01-10 01:02:41,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1340, PETRI_PLACES=177, PETRI_TRANSITIONS=127} [2025-01-10 01:02:41,082 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 115 predicate places. [2025-01-10 01:02:41,083 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 127 transitions, 1340 flow [2025-01-10 01:02:41,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:41,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:41,083 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:41,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-10 01:02:41,083 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:41,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1866949175, now seen corresponding path program 3 times [2025-01-10 01:02:41,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:41,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680358306] [2025-01-10 01:02:41,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:02:41,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:41,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 6 equivalence classes. [2025-01-10 01:02:41,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 47 statements. [2025-01-10 01:02:41,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 01:02:41,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:41,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680358306] [2025-01-10 01:02:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680358306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-10 01:02:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295266086] [2025-01-10 01:02:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:41,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:02:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:41,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:02:41,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:02:41,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:41,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 127 transitions, 1340 flow. Second operand has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:41,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:41,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:41,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:46,553 INFO L124 PetriNetUnfolderBase]: 17287/34846 cut-off events. [2025-01-10 01:02:46,554 INFO L125 PetriNetUnfolderBase]: For 139911/140097 co-relation queries the response was YES. [2025-01-10 01:02:46,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124533 conditions, 34846 events. 17287/34846 cut-off events. For 139911/140097 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 299340 event pairs, 12251 based on Foata normal form. 9/34821 useless extension candidates. Maximal degree in co-relation 124362. Up to 21764 conditions per place. [2025-01-10 01:02:47,097 INFO L140 encePairwiseOnDemand]: 52/66 looper letters, 208 selfloop transitions, 42 changer transitions 0/267 dead transitions. [2025-01-10 01:02:47,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 267 transitions, 3074 flow [2025-01-10 01:02:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:02:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:02:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 583 transitions. [2025-01-10 01:02:47,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-01-10 01:02:47,099 INFO L175 Difference]: Start difference. First operand has 177 places, 127 transitions, 1340 flow. Second operand 14 states and 583 transitions. [2025-01-10 01:02:47,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 267 transitions, 3074 flow [2025-01-10 01:02:47,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 267 transitions, 2937 flow, removed 67 selfloop flow, removed 2 redundant places. [2025-01-10 01:02:47,452 INFO L231 Difference]: Finished difference. Result has 196 places, 142 transitions, 1662 flow [2025-01-10 01:02:47,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1662, PETRI_PLACES=196, PETRI_TRANSITIONS=142} [2025-01-10 01:02:47,452 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 134 predicate places. [2025-01-10 01:02:47,452 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 142 transitions, 1662 flow [2025-01-10 01:02:47,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 34.333333333333336) internal successors, (412), 12 states have internal predecessors, (412), 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:02:47,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:47,453 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:47,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-10 01:02:47,453 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:47,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:47,453 INFO L85 PathProgramCache]: Analyzing trace with hash 498233371, now seen corresponding path program 4 times [2025-01-10 01:02:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983225404] [2025-01-10 01:02:47,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:02:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:47,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-01-10 01:02:47,469 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 34 of 47 statements. [2025-01-10 01:02:47,469 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 01:02:47,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983225404] [2025-01-10 01:02:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983225404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:02:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 01:02:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396076533] [2025-01-10 01:02:47,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:02:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:47,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:02:47,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 01:02:48,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:48,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 142 transitions, 1662 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 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:02:48,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:48,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:48,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:02:53,031 INFO L124 PetriNetUnfolderBase]: 17348/34900 cut-off events. [2025-01-10 01:02:53,031 INFO L125 PetriNetUnfolderBase]: For 142516/142570 co-relation queries the response was YES. [2025-01-10 01:02:53,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122560 conditions, 34900 events. 17348/34900 cut-off events. For 142516/142570 co-relation queries the response was YES. Maximal size of possible extension queue 498. Compared 297627 event pairs, 13663 based on Foata normal form. 9/34859 useless extension candidates. Maximal degree in co-relation 122381. Up to 21623 conditions per place. [2025-01-10 01:02:53,765 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 169 selfloop transitions, 55 changer transitions 0/241 dead transitions. [2025-01-10 01:02:53,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 241 transitions, 2873 flow [2025-01-10 01:02:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:02:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:02:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-01-10 01:02:53,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6570247933884298 [2025-01-10 01:02:53,767 INFO L175 Difference]: Start difference. First operand has 196 places, 142 transitions, 1662 flow. Second operand 11 states and 477 transitions. [2025-01-10 01:02:53,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 241 transitions, 2873 flow [2025-01-10 01:02:54,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 241 transitions, 2762 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-01-10 01:02:54,072 INFO L231 Difference]: Finished difference. Result has 208 places, 160 transitions, 1976 flow [2025-01-10 01:02:54,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1976, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2025-01-10 01:02:54,074 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 146 predicate places. [2025-01-10 01:02:54,074 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 1976 flow [2025-01-10 01:02:54,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 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:02:54,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:02:54,075 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:02:54,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-10 01:02:54,075 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-01-10 01:02:54,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:02:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1312218449, now seen corresponding path program 5 times [2025-01-10 01:02:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:02:54,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968981] [2025-01-10 01:02:54,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:02:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:02:54,083 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-01-10 01:02:54,115 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:02:54,115 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 01:02:54,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-10 01:02:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:02:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968981] [2025-01-10 01:02:54,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:02:54,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367157659] [2025-01-10 01:02:54,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:02:54,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:02:54,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:02:54,602 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:02:54,603 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:02:54,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 6 equivalence classes. [2025-01-10 01:02:54,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 01:02:54,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-10 01:02:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:02:54,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:02:54,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:02:54,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 01:02:54,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 01:02:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-10 01:02:54,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:02:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367157659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:02:54,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:02:54,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-01-10 01:02:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976547556] [2025-01-10 01:02:54,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:02:54,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 01:02:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:02:54,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 01:02:54,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:02:55,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2025-01-10 01:02:55,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 1976 flow. Second operand has 9 states, 9 states have (on average 35.111111111111114) internal successors, (316), 9 states have internal predecessors, (316), 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:02:55,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:02:55,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2025-01-10 01:02:55,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand