./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-commit-1.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 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:07:23,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:07:23,875 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:07:23,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:07:23,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:07:23,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:07:23,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:07:23,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:07:23,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:07:23,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:07:23,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:07:23,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:07:23,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:07:23,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:07:23,923 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:07:23,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:07:23,924 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:07:23,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:07:23,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:07:23,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:07:23,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:23,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:23,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:23,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:23,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:07:23,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:23,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:07:23,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:07:23,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:07:23,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:07:23,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:07:23,928 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 -> 73c55a951ef2b92a665c2c32d76e33a5a03bdbde67ee3c8e6748faf493088c7e [2025-01-10 01:07:24,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:07:24,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:07:24,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:07:24,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:07:24,219 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:07:24,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-01-10 01:07:25,561 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544e0c125/1a46ac67bbc447d89ff4afc54cc2b179/FLAG7b3cf6b7d [2025-01-10 01:07:25,794 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:07:25,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-1.wvr.c [2025-01-10 01:07:25,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544e0c125/1a46ac67bbc447d89ff4afc54cc2b179/FLAG7b3cf6b7d [2025-01-10 01:07:25,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/544e0c125/1a46ac67bbc447d89ff4afc54cc2b179 [2025-01-10 01:07:25,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:07:25,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:07:25,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:25,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:07:25,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:07:25,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:25" (1/1) ... [2025-01-10 01:07:25,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413ec881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:25, skipping insertion in model container [2025-01-10 01:07:25,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:07:25" (1/1) ... [2025-01-10 01:07:25,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:07:26,029 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:07:26,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:26,048 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:07:26,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:07:26,104 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:07:26,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26 WrapperNode [2025-01-10 01:07:26,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:07:26,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:26,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:07:26,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:07:26,113 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:07:26" (1/1) ... [2025-01-10 01:07:26,123 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:07:26" (1/1) ... [2025-01-10 01:07:26,159 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 327 [2025-01-10 01:07:26,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:07:26,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:07:26,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:07:26,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:07:26,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,208 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 01:07:26,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,226 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:07:26,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:07:26,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:07:26,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:07:26,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (1/1) ... [2025-01-10 01:07:26,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:07:26,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:26,294 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:07:26,296 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:07:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:07:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:07:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:07:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:07:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:07:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:07:26,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:07:26,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:07:26,318 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:07:26,417 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:07:26,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:07:26,954 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:07:26,954 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:07:27,295 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:07:27,295 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 01:07:27,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:27 BoogieIcfgContainer [2025-01-10 01:07:27,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:07:27,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:07:27,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:07:27,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:07:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:07:25" (1/3) ... [2025-01-10 01:07:27,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d884d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:27, skipping insertion in model container [2025-01-10 01:07:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:07:26" (2/3) ... [2025-01-10 01:07:27,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d884d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:07:27, skipping insertion in model container [2025-01-10 01:07:27,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:07:27" (3/3) ... [2025-01-10 01:07:27,304 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2025-01-10 01:07:27,319 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:07:27,320 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-commit-1.wvr.c that has 4 procedures, 67 locations, 1 initial locations, 6 loop locations, and 24 error locations. [2025-01-10 01:07:27,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:07:27,395 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:07:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 171 flow [2025-01-10 01:07:27,497 INFO L124 PetriNetUnfolderBase]: 9/72 cut-off events. [2025-01-10 01:07:27,499 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:07:27,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 72 events. 9/72 cut-off events. For 3/3 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/39 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-01-10 01:07:27,505 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 75 transitions, 171 flow [2025-01-10 01:07:27,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 71 transitions, 160 flow [2025-01-10 01:07:27,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:07:27,538 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;@4e0a5f3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:07:27,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-01-10 01:07:27,542 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:07:27,543 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:07:27,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:07:27,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:27,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:27,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:27,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1014865, now seen corresponding path program 1 times [2025-01-10 01:07:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489092294] [2025-01-10 01:07:27,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:27,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:27,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:27,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:27,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:27,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:27,798 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:07:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489092294] [2025-01-10 01:07:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489092294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:27,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:27,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:07:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447392432] [2025-01-10 01:07:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:27,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:27,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:27,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:27,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:27,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:27,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:07:27,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:27,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:27,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:29,684 INFO L124 PetriNetUnfolderBase]: 11258/15925 cut-off events. [2025-01-10 01:07:29,685 INFO L125 PetriNetUnfolderBase]: For 553/553 co-relation queries the response was YES. [2025-01-10 01:07:29,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32375 conditions, 15925 events. 11258/15925 cut-off events. For 553/553 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 90656 event pairs, 10184 based on Foata normal form. 1/9499 useless extension candidates. Maximal degree in co-relation 31435. Up to 15894 conditions per place. [2025-01-10 01:07:29,849 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 54 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2025-01-10 01:07:29,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 256 flow [2025-01-10 01:07:29,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:29,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-01-10 01:07:29,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2025-01-10 01:07:29,864 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 160 flow. Second operand 3 states and 96 transitions. [2025-01-10 01:07:29,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 256 flow [2025-01-10 01:07:29,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:29,887 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 136 flow [2025-01-10 01:07:29,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-01-10 01:07:29,896 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2025-01-10 01:07:29,896 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 136 flow [2025-01-10 01:07:29,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:07:29,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:29,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:07:29,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:07:29,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:29,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1014866, now seen corresponding path program 1 times [2025-01-10 01:07:29,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:29,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84703796] [2025-01-10 01:07:29,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:29,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:29,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:07:29,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:07:29,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:29,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:30,254 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:07:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84703796] [2025-01-10 01:07:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84703796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:30,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29785185] [2025-01-10 01:07:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:30,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:30,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:30,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:30,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:07:30,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:30,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:30,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:31,807 INFO L124 PetriNetUnfolderBase]: 11261/15934 cut-off events. [2025-01-10 01:07:31,808 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-01-10 01:07:31,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32059 conditions, 15934 events. 11261/15934 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 90650 event pairs, 10184 based on Foata normal form. 0/9503 useless extension candidates. Maximal degree in co-relation 32009. Up to 15907 conditions per place. [2025-01-10 01:07:31,895 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 58 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2025-01-10 01:07:31,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 292 flow [2025-01-10 01:07:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2025-01-10 01:07:31,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-01-10 01:07:31,899 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 136 flow. Second operand 4 states and 115 transitions. [2025-01-10 01:07:31,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 292 flow [2025-01-10 01:07:31,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:31,904 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 214 flow [2025-01-10 01:07:31,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2025-01-10 01:07:31,906 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2025-01-10 01:07:31,906 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 214 flow [2025-01-10 01:07:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:07:31,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:31,906 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:07:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:07:31,907 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 975318950, now seen corresponding path program 1 times [2025-01-10 01:07:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500331191] [2025-01-10 01:07:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:31,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:31,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:31,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:31,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:32,261 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:07:32,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500331191] [2025-01-10 01:07:32,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500331191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:32,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811855595] [2025-01-10 01:07:32,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:32,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:32,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:32,265 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:07:32,267 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:07:32,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:07:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:07:32,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:32,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:32,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:07:32,635 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:07:32,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:32,753 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:07:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811855595] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:32,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:32,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:07:32,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000687905] [2025-01-10 01:07:32,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:32,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:07:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:32,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:07:32,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:32,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:32,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 214 flow. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 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:07:32,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:32,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:32,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:34,541 INFO L124 PetriNetUnfolderBase]: 11264/15940 cut-off events. [2025-01-10 01:07:34,541 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-01-10 01:07:34,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32110 conditions, 15940 events. 11264/15940 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 90820 event pairs, 10184 based on Foata normal form. 0/9514 useless extension candidates. Maximal degree in co-relation 32023. Up to 15896 conditions per place. [2025-01-10 01:07:34,646 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 48 selfloop transitions, 26 changer transitions 0/78 dead transitions. [2025-01-10 01:07:34,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 390 flow [2025-01-10 01:07:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:07:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:07:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2025-01-10 01:07:34,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28 [2025-01-10 01:07:34,651 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 214 flow. Second operand 8 states and 168 transitions. [2025-01-10 01:07:34,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 390 flow [2025-01-10 01:07:34,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 78 transitions, 390 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:34,655 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 294 flow [2025-01-10 01:07:34,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=294, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2025-01-10 01:07:34,656 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-01-10 01:07:34,656 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 294 flow [2025-01-10 01:07:34,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 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:07:34,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:34,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:34,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:07:34,862 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:07:34,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:34,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1985290220, now seen corresponding path program 1 times [2025-01-10 01:07:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597227413] [2025-01-10 01:07:34,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:34,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:07:34,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:07:34,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:34,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:34,924 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:07:34,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:34,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597227413] [2025-01-10 01:07:34,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597227413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:34,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:34,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:07:34,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397595241] [2025-01-10 01:07:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:34,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:34,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:34,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:34,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:34,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:07:34,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:34,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:34,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:36,014 INFO L124 PetriNetUnfolderBase]: 13086/18562 cut-off events. [2025-01-10 01:07:36,015 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-01-10 01:07:36,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37407 conditions, 18562 events. 13086/18562 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 107929 event pairs, 4436 based on Foata normal form. 162/11415 useless extension candidates. Maximal degree in co-relation 37295. Up to 15883 conditions per place. [2025-01-10 01:07:36,106 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 99 selfloop transitions, 3 changer transitions 0/106 dead transitions. [2025-01-10 01:07:36,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 558 flow [2025-01-10 01:07:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-01-10 01:07:36,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5733333333333334 [2025-01-10 01:07:36,108 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 294 flow. Second operand 3 states and 129 transitions. [2025-01-10 01:07:36,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 558 flow [2025-01-10 01:07:36,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 487 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:36,111 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 246 flow [2025-01-10 01:07:36,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2025-01-10 01:07:36,112 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2025-01-10 01:07:36,112 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 246 flow [2025-01-10 01:07:36,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:07:36,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:36,113 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:36,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:07:36,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:36,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:36,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1030022170, now seen corresponding path program 1 times [2025-01-10 01:07:36,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:36,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252562914] [2025-01-10 01:07:36,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:36,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:36,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 01:07:36,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 01:07:36,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:36,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:36,216 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:07:36,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252562914] [2025-01-10 01:07:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252562914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586519216] [2025-01-10 01:07:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:36,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:36,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:36,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:36,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:36,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:07:36,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:36,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:36,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:37,347 INFO L124 PetriNetUnfolderBase]: 12333/17526 cut-off events. [2025-01-10 01:07:37,347 INFO L125 PetriNetUnfolderBase]: For 627/627 co-relation queries the response was YES. [2025-01-10 01:07:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36974 conditions, 17526 events. 12333/17526 cut-off events. For 627/627 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 96089 event pairs, 4948 based on Foata normal form. 297/11634 useless extension candidates. Maximal degree in co-relation 11791. Up to 12773 conditions per place. [2025-01-10 01:07:37,431 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 102 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-01-10 01:07:37,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 518 flow [2025-01-10 01:07:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 01:07:37,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-01-10 01:07:37,433 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 246 flow. Second operand 3 states and 130 transitions. [2025-01-10 01:07:37,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 518 flow [2025-01-10 01:07:37,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:37,440 INFO L231 Difference]: Finished difference. Result has 70 places, 80 transitions, 255 flow [2025-01-10 01:07:37,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2025-01-10 01:07:37,440 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 01:07:37,440 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 255 flow [2025-01-10 01:07:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:07:37,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:37,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:37,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:07:37,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:37,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash -150751751, now seen corresponding path program 1 times [2025-01-10 01:07:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:37,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696739] [2025-01-10 01:07:37,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:37,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:37,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:07:37,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:07:37,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:37,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:37,551 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:07:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696739] [2025-01-10 01:07:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741670214] [2025-01-10 01:07:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:37,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:37,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:37,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:37,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:37,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:07:37,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:37,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:37,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:38,954 INFO L124 PetriNetUnfolderBase]: 12946/18508 cut-off events. [2025-01-10 01:07:38,954 INFO L125 PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES. [2025-01-10 01:07:38,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40328 conditions, 18508 events. 12946/18508 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 103032 event pairs, 11912 based on Foata normal form. 112/12564 useless extension candidates. Maximal degree in co-relation 12447. Up to 17508 conditions per place. [2025-01-10 01:07:39,047 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 105 selfloop transitions, 8 changer transitions 3/120 dead transitions. [2025-01-10 01:07:39,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 120 transitions, 611 flow [2025-01-10 01:07:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:39,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-01-10 01:07:39,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44266666666666665 [2025-01-10 01:07:39,049 INFO L175 Difference]: Start difference. First operand has 70 places, 80 transitions, 255 flow. Second operand 5 states and 166 transitions. [2025-01-10 01:07:39,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 120 transitions, 611 flow [2025-01-10 01:07:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:39,055 INFO L231 Difference]: Finished difference. Result has 75 places, 85 transitions, 320 flow [2025-01-10 01:07:39,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=75, PETRI_TRANSITIONS=85} [2025-01-10 01:07:39,057 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-01-10 01:07:39,058 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 85 transitions, 320 flow [2025-01-10 01:07:39,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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:07:39,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:39,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:39,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:07:39,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:39,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:39,060 INFO L85 PathProgramCache]: Analyzing trace with hash 110973005, now seen corresponding path program 1 times [2025-01-10 01:07:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:39,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508781847] [2025-01-10 01:07:39,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:39,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:39,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:39,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508781847] [2025-01-10 01:07:39,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508781847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:39,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:39,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:39,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692868568] [2025-01-10 01:07:39,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:39,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:39,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:39,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:39,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 85 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:07:39,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:39,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:39,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:40,151 INFO L124 PetriNetUnfolderBase]: 9843/14132 cut-off events. [2025-01-10 01:07:40,151 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2025-01-10 01:07:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31166 conditions, 14132 events. 9843/14132 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 76582 event pairs, 9001 based on Foata normal form. 0/10250 useless extension candidates. Maximal degree in co-relation 29133. Up to 14062 conditions per place. [2025-01-10 01:07:40,198 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 69 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2025-01-10 01:07:40,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 462 flow [2025-01-10 01:07:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-01-10 01:07:40,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.296 [2025-01-10 01:07:40,200 INFO L175 Difference]: Start difference. First operand has 75 places, 85 transitions, 320 flow. Second operand 5 states and 111 transitions. [2025-01-10 01:07:40,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 462 flow [2025-01-10 01:07:40,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 81 transitions, 458 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:40,205 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 320 flow [2025-01-10 01:07:40,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2025-01-10 01:07:40,205 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2025-01-10 01:07:40,205 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 320 flow [2025-01-10 01:07:40,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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:07:40,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:40,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:40,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:07:40,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:40,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 110973006, now seen corresponding path program 1 times [2025-01-10 01:07:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132275799] [2025-01-10 01:07:40,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:40,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:40,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:40,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:40,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132275799] [2025-01-10 01:07:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132275799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252526833] [2025-01-10 01:07:40,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:40,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:40,617 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:07:40,619 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:07:40,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:07:40,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:07:40,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:40,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:40,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 01:07:40,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:40,736 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:07:40,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:40,810 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 18 treesize of output 13 [2025-01-10 01:07:40,835 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 01:07:40,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 01:07:40,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:40,871 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 18 treesize of output 13 [2025-01-10 01:07:40,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:40,879 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:07:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:07:40,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252526833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-01-10 01:07:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179996685] [2025-01-10 01:07:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:40,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:40,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:40,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:07:40,966 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:40,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:07:40,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:40,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:41,569 INFO L124 PetriNetUnfolderBase]: 7310/10556 cut-off events. [2025-01-10 01:07:41,569 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-01-10 01:07:41,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22898 conditions, 10556 events. 7310/10556 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 55529 event pairs, 6640 based on Foata normal form. 568/8326 useless extension candidates. Maximal degree in co-relation 20779. Up to 10519 conditions per place. [2025-01-10 01:07:41,613 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 69 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2025-01-10 01:07:41,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 454 flow [2025-01-10 01:07:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-01-10 01:07:41,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32 [2025-01-10 01:07:41,614 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 320 flow. Second operand 4 states and 96 transitions. [2025-01-10 01:07:41,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 454 flow [2025-01-10 01:07:41,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 442 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:41,616 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 304 flow [2025-01-10 01:07:41,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-01-10 01:07:41,617 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 01:07:41,617 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 304 flow [2025-01-10 01:07:41,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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:07:41,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:41,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:41,624 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:07:41,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:41,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:41,819 INFO L85 PathProgramCache]: Analyzing trace with hash -854803007, now seen corresponding path program 1 times [2025-01-10 01:07:41,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:41,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429180298] [2025-01-10 01:07:41,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:41,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:41,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:07:41,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:07:41,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:41,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429180298] [2025-01-10 01:07:41,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429180298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932313993] [2025-01-10 01:07:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:41,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:41,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:41,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:41,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:07:41,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:41,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:41,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:42,391 INFO L124 PetriNetUnfolderBase]: 5974/8687 cut-off events. [2025-01-10 01:07:42,392 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-01-10 01:07:42,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18967 conditions, 8687 events. 5974/8687 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 43444 event pairs, 2918 based on Foata normal form. 158/6500 useless extension candidates. Maximal degree in co-relation 16909. Up to 6301 conditions per place. [2025-01-10 01:07:42,422 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 99 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-01-10 01:07:42,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 575 flow [2025-01-10 01:07:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-01-10 01:07:42,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-01-10 01:07:42,423 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 304 flow. Second operand 3 states and 123 transitions. [2025-01-10 01:07:42,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 575 flow [2025-01-10 01:07:42,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 105 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:42,427 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 315 flow [2025-01-10 01:07:42,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2025-01-10 01:07:42,428 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-01-10 01:07:42,428 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 315 flow [2025-01-10 01:07:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:07:42,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:42,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:42,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:07:42,429 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:42,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:42,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1288030191, now seen corresponding path program 1 times [2025-01-10 01:07:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320004741] [2025-01-10 01:07:42,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:42,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:42,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320004741] [2025-01-10 01:07:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320004741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:42,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781036244] [2025-01-10 01:07:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:42,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:42,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:42,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 78 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:07:42,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:42,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:42,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:42,981 INFO L124 PetriNetUnfolderBase]: 5133/7500 cut-off events. [2025-01-10 01:07:42,981 INFO L125 PetriNetUnfolderBase]: For 888/888 co-relation queries the response was YES. [2025-01-10 01:07:42,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16980 conditions, 7500 events. 5133/7500 cut-off events. For 888/888 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 37647 event pairs, 4614 based on Foata normal form. 0/5868 useless extension candidates. Maximal degree in co-relation 14921. Up to 7431 conditions per place. [2025-01-10 01:07:43,010 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 67 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-01-10 01:07:43,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 453 flow [2025-01-10 01:07:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-01-10 01:07:43,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30666666666666664 [2025-01-10 01:07:43,012 INFO L175 Difference]: Start difference. First operand has 71 places, 78 transitions, 315 flow. Second operand 4 states and 92 transitions. [2025-01-10 01:07:43,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 453 flow [2025-01-10 01:07:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:07:43,014 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 317 flow [2025-01-10 01:07:43,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=317, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2025-01-10 01:07:43,015 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-01-10 01:07:43,015 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 317 flow [2025-01-10 01:07:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:07:43,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:43,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:07:43,016 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1288030192, now seen corresponding path program 1 times [2025-01-10 01:07:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392678815] [2025-01-10 01:07:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:43,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 01:07:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 01:07:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392678815] [2025-01-10 01:07:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392678815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466263261] [2025-01-10 01:07:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:43,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:43,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:43,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 317 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:07:43,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:43,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:43,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:43,695 INFO L124 PetriNetUnfolderBase]: 6475/9622 cut-off events. [2025-01-10 01:07:43,695 INFO L125 PetriNetUnfolderBase]: For 1000/1000 co-relation queries the response was YES. [2025-01-10 01:07:43,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21371 conditions, 9622 events. 6475/9622 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 51278 event pairs, 5958 based on Foata normal form. 20/7625 useless extension candidates. Maximal degree in co-relation 17363. Up to 7440 conditions per place. [2025-01-10 01:07:43,733 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 76 selfloop transitions, 15 changer transitions 5/100 dead transitions. [2025-01-10 01:07:43,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 569 flow [2025-01-10 01:07:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-01-10 01:07:43,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4026666666666667 [2025-01-10 01:07:43,735 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 317 flow. Second operand 5 states and 151 transitions. [2025-01-10 01:07:43,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 569 flow [2025-01-10 01:07:43,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 100 transitions, 563 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:43,737 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 356 flow [2025-01-10 01:07:43,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2025-01-10 01:07:43,737 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2025-01-10 01:07:43,737 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 356 flow [2025-01-10 01:07:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:07:43,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:43,738 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:43,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:07:43,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash -663415351, now seen corresponding path program 1 times [2025-01-10 01:07:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397529756] [2025-01-10 01:07:43,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:43,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:43,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:43,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:43,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:43,980 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:07:43,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:43,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397529756] [2025-01-10 01:07:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397529756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:43,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673527191] [2025-01-10 01:07:43,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:43,984 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:07:43,986 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:07:44,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:07:44,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:07:44,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:44,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:44,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:07:44,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:07:44,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673527191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:44,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:44,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:07:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654747439] [2025-01-10 01:07:44,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:44,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:44,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:44,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:44,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:07:44,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:44,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 356 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:07:44,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:44,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:44,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:44,660 INFO L124 PetriNetUnfolderBase]: 5714/8547 cut-off events. [2025-01-10 01:07:44,660 INFO L125 PetriNetUnfolderBase]: For 1034/1034 co-relation queries the response was YES. [2025-01-10 01:07:44,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18831 conditions, 8547 events. 5714/8547 cut-off events. For 1034/1034 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 45563 event pairs, 5266 based on Foata normal form. 122/6981 useless extension candidates. Maximal degree in co-relation 14809. Up to 8450 conditions per place. [2025-01-10 01:07:44,688 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 57 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-01-10 01:07:44,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 488 flow [2025-01-10 01:07:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-10 01:07:44,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-01-10 01:07:44,689 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 356 flow. Second operand 4 states and 102 transitions. [2025-01-10 01:07:44,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 488 flow [2025-01-10 01:07:44,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 74 transitions, 469 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:44,691 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 355 flow [2025-01-10 01:07:44,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2025-01-10 01:07:44,692 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2025-01-10 01:07:44,692 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 355 flow [2025-01-10 01:07:44,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:07:44,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:44,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:44,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:07:44,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:44,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:44,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1886958037, now seen corresponding path program 1 times [2025-01-10 01:07:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378614] [2025-01-10 01:07:44,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:44,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:07:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:07:44,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:44,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378614] [2025-01-10 01:07:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:45,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665352608] [2025-01-10 01:07:45,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:45,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:45,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:45,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:45,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:45,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:45,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:45,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:45,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:45,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:45,724 INFO L124 PetriNetUnfolderBase]: 8442/12875 cut-off events. [2025-01-10 01:07:45,724 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2025-01-10 01:07:45,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27870 conditions, 12875 events. 8442/12875 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 76482 event pairs, 7988 based on Foata normal form. 28/10437 useless extension candidates. Maximal degree in co-relation 19917. Up to 8477 conditions per place. [2025-01-10 01:07:45,789 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 88 selfloop transitions, 12 changer transitions 9/113 dead transitions. [2025-01-10 01:07:45,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 725 flow [2025-01-10 01:07:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-01-10 01:07:45,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4186666666666667 [2025-01-10 01:07:45,791 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 355 flow. Second operand 5 states and 157 transitions. [2025-01-10 01:07:45,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 725 flow [2025-01-10 01:07:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 113 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:45,794 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 426 flow [2025-01-10 01:07:45,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2025-01-10 01:07:45,795 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-01-10 01:07:45,795 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 426 flow [2025-01-10 01:07:45,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:45,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:45,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:07:45,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1901632642, now seen corresponding path program 1 times [2025-01-10 01:07:45,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701027716] [2025-01-10 01:07:45,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:45,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 01:07:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 01:07:45,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:45,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:07:45,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:45,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701027716] [2025-01-10 01:07:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701027716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:45,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:07:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349890330] [2025-01-10 01:07:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:45,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:07:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:45,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:07:45,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:07:45,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:45,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 426 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:07:45,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:45,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:45,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:47,010 INFO L124 PetriNetUnfolderBase]: 12994/19429 cut-off events. [2025-01-10 01:07:47,010 INFO L125 PetriNetUnfolderBase]: For 2875/2875 co-relation queries the response was YES. [2025-01-10 01:07:47,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43783 conditions, 19429 events. 12994/19429 cut-off events. For 2875/2875 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 110253 event pairs, 8638 based on Foata normal form. 216/15690 useless extension candidates. Maximal degree in co-relation 35818. Up to 11159 conditions per place. [2025-01-10 01:07:47,086 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 124 selfloop transitions, 8 changer transitions 0/136 dead transitions. [2025-01-10 01:07:47,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 136 transitions, 862 flow [2025-01-10 01:07:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-01-10 01:07:47,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266666666666666 [2025-01-10 01:07:47,087 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 426 flow. Second operand 4 states and 158 transitions. [2025-01-10 01:07:47,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 136 transitions, 862 flow [2025-01-10 01:07:47,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:47,091 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 479 flow [2025-01-10 01:07:47,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=479, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-01-10 01:07:47,092 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2025-01-10 01:07:47,092 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 479 flow [2025-01-10 01:07:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:07:47,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:47,092 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:47,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:07:47,092 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:47,093 INFO L85 PathProgramCache]: Analyzing trace with hash 569926712, now seen corresponding path program 1 times [2025-01-10 01:07:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:47,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766960141] [2025-01-10 01:07:47,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:47,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:07:47,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:07:47,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:47,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:47,141 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:07:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766960141] [2025-01-10 01:07:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766960141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:47,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:47,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:07:47,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788326221] [2025-01-10 01:07:47,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:07:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:47,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:07:47,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:07:47,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:47,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:07:47,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:47,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:48,235 INFO L124 PetriNetUnfolderBase]: 12994/19413 cut-off events. [2025-01-10 01:07:48,235 INFO L125 PetriNetUnfolderBase]: For 6813/6813 co-relation queries the response was YES. [2025-01-10 01:07:48,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46684 conditions, 19413 events. 12994/19413 cut-off events. For 6813/6813 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 110149 event pairs, 10339 based on Foata normal form. 8/15466 useless extension candidates. Maximal degree in co-relation 38732. Up to 10967 conditions per place. [2025-01-10 01:07:48,299 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 74 selfloop transitions, 2 changer transitions 21/101 dead transitions. [2025-01-10 01:07:48,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 101 transitions, 716 flow [2025-01-10 01:07:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:07:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:07:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-01-10 01:07:48,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-01-10 01:07:48,300 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 479 flow. Second operand 3 states and 105 transitions. [2025-01-10 01:07:48,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 101 transitions, 716 flow [2025-01-10 01:07:48,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 101 transitions, 708 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-01-10 01:07:48,310 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 346 flow [2025-01-10 01:07:48,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2025-01-10 01:07:48,311 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 11 predicate places. [2025-01-10 01:07:48,311 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 346 flow [2025-01-10 01:07:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:07:48,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:48,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:07:48,311 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1067562998, now seen corresponding path program 1 times [2025-01-10 01:07:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616944494] [2025-01-10 01:07:48,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:48,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:07:48,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:07:48,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:48,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:48,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616944494] [2025-01-10 01:07:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616944494] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:48,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093901269] [2025-01-10 01:07:48,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:48,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:48,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:48,476 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:07:48,479 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:07:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 01:07:48,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 01:07:48,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:48,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:07:48,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:48,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:48,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:07:48,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093901269] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:48,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:48,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-01-10 01:07:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941807928] [2025-01-10 01:07:48,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:07:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:48,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:07:48,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:07:48,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:48,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 346 flow. Second operand has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:48,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:48,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:48,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:50,084 INFO L124 PetriNetUnfolderBase]: 9029/13114 cut-off events. [2025-01-10 01:07:50,084 INFO L125 PetriNetUnfolderBase]: For 5674/5674 co-relation queries the response was YES. [2025-01-10 01:07:50,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33032 conditions, 13114 events. 9029/13114 cut-off events. For 5674/5674 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 66004 event pairs, 7859 based on Foata normal form. 2/10403 useless extension candidates. Maximal degree in co-relation 30242. Up to 11889 conditions per place. [2025-01-10 01:07:50,160 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 51 selfloop transitions, 17 changer transitions 58/130 dead transitions. [2025-01-10 01:07:50,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 797 flow [2025-01-10 01:07:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:07:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:07:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2025-01-10 01:07:50,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-01-10 01:07:50,162 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 346 flow. Second operand 9 states and 225 transitions. [2025-01-10 01:07:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 797 flow [2025-01-10 01:07:50,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 130 transitions, 744 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-01-10 01:07:50,177 INFO L231 Difference]: Finished difference. Result has 85 places, 72 transitions, 347 flow [2025-01-10 01:07:50,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=85, PETRI_TRANSITIONS=72} [2025-01-10 01:07:50,177 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 13 predicate places. [2025-01-10 01:07:50,178 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 72 transitions, 347 flow [2025-01-10 01:07:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.5) internal successors, (259), 14 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:07:50,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:50,178 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:50,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 01:07:50,378 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,SelfDestructingSolverStorable15 [2025-01-10 01:07:50,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash -172956342, now seen corresponding path program 2 times [2025-01-10 01:07:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:50,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936244004] [2025-01-10 01:07:50,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:50,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:50,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-10 01:07:50,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 33 statements. [2025-01-10 01:07:50,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:07:50,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:07:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936244004] [2025-01-10 01:07:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936244004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:50,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:50,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657291710] [2025-01-10 01:07:50,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:50,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:07:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:50,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:07:50,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:07:50,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:50,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 72 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:07:50,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:50,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:50,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:51,634 INFO L124 PetriNetUnfolderBase]: 6676/9647 cut-off events. [2025-01-10 01:07:51,634 INFO L125 PetriNetUnfolderBase]: For 4785/4785 co-relation queries the response was YES. [2025-01-10 01:07:51,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24111 conditions, 9647 events. 6676/9647 cut-off events. For 4785/4785 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 46383 event pairs, 5798 based on Foata normal form. 0/8070 useless extension candidates. Maximal degree in co-relation 24059. Up to 9609 conditions per place. [2025-01-10 01:07:51,685 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 61 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2025-01-10 01:07:51,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 70 transitions, 473 flow [2025-01-10 01:07:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:07:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:07:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-01-10 01:07:51,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.264 [2025-01-10 01:07:51,686 INFO L175 Difference]: Start difference. First operand has 85 places, 72 transitions, 347 flow. Second operand 5 states and 99 transitions. [2025-01-10 01:07:51,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 70 transitions, 473 flow [2025-01-10 01:07:51,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 431 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:51,696 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 309 flow [2025-01-10 01:07:51,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2025-01-10 01:07:51,697 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-01-10 01:07:51,697 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 309 flow [2025-01-10 01:07:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:07:51,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:51,697 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:07:51,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash -172956341, now seen corresponding path program 1 times [2025-01-10 01:07:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656361625] [2025-01-10 01:07:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:51,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:07:51,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:07:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:52,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656361625] [2025-01-10 01:07:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656361625] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641461509] [2025-01-10 01:07:52,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:52,099 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:07:52,102 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:07:52,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 01:07:52,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 01:07:52,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:52,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:52,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:07:52,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:52,237 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:07:52,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:07:52,286 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 18 treesize of output 13 [2025-01-10 01:07:52,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-10 01:07:52,299 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:07:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:52,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:07:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641461509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:52,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:07:52,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:07:52,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835257976] [2025-01-10 01:07:52,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:52,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:52,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:07:52,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 75 [2025-01-10 01:07:52,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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:07:52,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:52,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 75 [2025-01-10 01:07:52,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:52,934 INFO L124 PetriNetUnfolderBase]: 5257/7631 cut-off events. [2025-01-10 01:07:52,934 INFO L125 PetriNetUnfolderBase]: For 3338/3338 co-relation queries the response was YES. [2025-01-10 01:07:52,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18871 conditions, 7631 events. 5257/7631 cut-off events. For 3338/3338 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 35972 event pairs, 4517 based on Foata normal form. 252/6822 useless extension candidates. Maximal degree in co-relation 18825. Up to 7601 conditions per place. [2025-01-10 01:07:52,959 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 61 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-01-10 01:07:52,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 68 transitions, 431 flow [2025-01-10 01:07:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:52,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-01-10 01:07:52,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2025-01-10 01:07:52,960 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 309 flow. Second operand 4 states and 86 transitions. [2025-01-10 01:07:52,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 68 transitions, 431 flow [2025-01-10 01:07:52,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 423 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:07:52,963 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 301 flow [2025-01-10 01:07:52,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2025-01-10 01:07:52,964 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2025-01-10 01:07:52,964 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 301 flow [2025-01-10 01:07:52,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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:07:52,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:52,964 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:52,970 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:07:53,164 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,SelfDestructingSolverStorable17 [2025-01-10 01:07:53,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 675540546, now seen corresponding path program 1 times [2025-01-10 01:07:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548355125] [2025-01-10 01:07:53,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:53,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:53,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:07:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:07:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548355125] [2025-01-10 01:07:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548355125] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918247409] [2025-01-10 01:07:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:07:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:53,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:53,345 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:07:53,348 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:07:53,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:07:53,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:07:53,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:07:53,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:53,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:07:53,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:53,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918247409] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:53,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 01:07:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798694193] [2025-01-10 01:07:53,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:53,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 01:07:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:53,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 01:07:53,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-10 01:07:53,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:53,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 301 flow. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 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:07:53,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:53,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:53,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:54,505 INFO L124 PetriNetUnfolderBase]: 6490/9672 cut-off events. [2025-01-10 01:07:54,505 INFO L125 PetriNetUnfolderBase]: For 4224/4224 co-relation queries the response was YES. [2025-01-10 01:07:54,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23643 conditions, 9672 events. 6490/9672 cut-off events. For 4224/4224 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 48793 event pairs, 5339 based on Foata normal form. 345/8647 useless extension candidates. Maximal degree in co-relation 23597. Up to 7600 conditions per place. [2025-01-10 01:07:54,532 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 47 selfloop transitions, 16 changer transitions 60/127 dead transitions. [2025-01-10 01:07:54,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 127 transitions, 772 flow [2025-01-10 01:07:54,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:07:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:07:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 267 transitions. [2025-01-10 01:07:54,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2966666666666667 [2025-01-10 01:07:54,534 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 301 flow. Second operand 12 states and 267 transitions. [2025-01-10 01:07:54,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 127 transitions, 772 flow [2025-01-10 01:07:54,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 127 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:54,537 INFO L231 Difference]: Finished difference. Result has 86 places, 67 transitions, 328 flow [2025-01-10 01:07:54,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=328, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2025-01-10 01:07:54,538 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2025-01-10 01:07:54,538 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 328 flow [2025-01-10 01:07:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 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:07:54,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:54,538 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:54,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 01:07:54,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:54,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:54,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:54,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1307674255, now seen corresponding path program 2 times [2025-01-10 01:07:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054308445] [2025-01-10 01:07:54,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:07:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:54,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-01-10 01:07:54,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 41 of 51 statements. [2025-01-10 01:07:54,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:07:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:07:55,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:55,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054308445] [2025-01-10 01:07:55,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054308445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:55,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:55,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-10 01:07:55,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727967287] [2025-01-10 01:07:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:07:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:55,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:07:55,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:07:55,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:55,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 328 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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:07:55,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:55,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:55,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:56,627 INFO L124 PetriNetUnfolderBase]: 6148/8915 cut-off events. [2025-01-10 01:07:56,627 INFO L125 PetriNetUnfolderBase]: For 4608/4608 co-relation queries the response was YES. [2025-01-10 01:07:56,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22513 conditions, 8915 events. 6148/8915 cut-off events. For 4608/4608 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 41448 event pairs, 2118 based on Foata normal form. 1/7652 useless extension candidates. Maximal degree in co-relation 22460. Up to 6518 conditions per place. [2025-01-10 01:07:56,668 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 112 selfloop transitions, 15 changer transitions 18/149 dead transitions. [2025-01-10 01:07:56,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 149 transitions, 836 flow [2025-01-10 01:07:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:07:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:07:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2025-01-10 01:07:56,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3546666666666667 [2025-01-10 01:07:56,669 INFO L175 Difference]: Start difference. First operand has 86 places, 67 transitions, 328 flow. Second operand 10 states and 266 transitions. [2025-01-10 01:07:56,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 149 transitions, 836 flow [2025-01-10 01:07:56,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 149 transitions, 816 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 01:07:56,677 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 424 flow [2025-01-10 01:07:56,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=424, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-01-10 01:07:56,678 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2025-01-10 01:07:56,678 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 424 flow [2025-01-10 01:07:56,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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:07:56,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:56,678 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:56,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:07:56,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:56,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:56,679 INFO L85 PathProgramCache]: Analyzing trace with hash 980843604, now seen corresponding path program 3 times [2025-01-10 01:07:56,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:56,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788184022] [2025-01-10 01:07:56,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:07:56,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:56,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 3 equivalence classes. [2025-01-10 01:07:56,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 51 of 55 statements. [2025-01-10 01:07:56,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:07:56,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:07:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:56,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788184022] [2025-01-10 01:07:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788184022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:07:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:07:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:07:56,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212343328] [2025-01-10 01:07:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:07:56,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:07:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:07:56,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:07:56,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:56,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:07:56,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:56,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:56,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:07:58,245 INFO L124 PetriNetUnfolderBase]: 14519/20945 cut-off events. [2025-01-10 01:07:58,245 INFO L125 PetriNetUnfolderBase]: For 15068/15068 co-relation queries the response was YES. [2025-01-10 01:07:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54541 conditions, 20945 events. 14519/20945 cut-off events. For 15068/15068 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 107127 event pairs, 6425 based on Foata normal form. 298/18340 useless extension candidates. Maximal degree in co-relation 54488. Up to 8314 conditions per place. [2025-01-10 01:07:58,420 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 127 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2025-01-10 01:07:58,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 945 flow [2025-01-10 01:07:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:07:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:07:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-01-10 01:07:58,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-01-10 01:07:58,422 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 424 flow. Second operand 4 states and 146 transitions. [2025-01-10 01:07:58,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 945 flow [2025-01-10 01:07:58,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 138 transitions, 925 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-01-10 01:07:58,440 INFO L231 Difference]: Finished difference. Result has 93 places, 80 transitions, 443 flow [2025-01-10 01:07:58,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=93, PETRI_TRANSITIONS=80} [2025-01-10 01:07:58,440 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 21 predicate places. [2025-01-10 01:07:58,440 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 443 flow [2025-01-10 01:07:58,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:07:58,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:07:58,441 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:07:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:07:58,441 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:07:58,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:07:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash 709750752, now seen corresponding path program 4 times [2025-01-10 01:07:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:07:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137005202] [2025-01-10 01:07:58,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:07:58,456 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-10 01:07:58,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:07:58,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:07:58,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:07:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137005202] [2025-01-10 01:07:58,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137005202] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:07:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068945750] [2025-01-10 01:07:58,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:07:58,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:07:58,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:07:58,644 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:07:58,646 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:07:58,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-01-10 01:07:58,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 01:07:58,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:07:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:07:58,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:07:58,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:07:58,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:58,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:07:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:07:59,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068945750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:07:59,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:07:59,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-01-10 01:07:59,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576072419] [2025-01-10 01:07:59,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:07:59,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:07:59,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:07:59,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:07:59,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:07:59,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:07:59,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 80 transitions, 443 flow. Second operand has 18 states, 18 states have (on average 19.5) internal successors, (351), 18 states have internal predecessors, (351), 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:07:59,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:07:59,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:07:59,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:01,015 INFO L124 PetriNetUnfolderBase]: 16079/23379 cut-off events. [2025-01-10 01:08:01,015 INFO L125 PetriNetUnfolderBase]: For 22523/22523 co-relation queries the response was YES. [2025-01-10 01:08:01,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62558 conditions, 23379 events. 16079/23379 cut-off events. For 22523/22523 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 126403 event pairs, 13613 based on Foata normal form. 137/20196 useless extension candidates. Maximal degree in co-relation 56837. Up to 20913 conditions per place. [2025-01-10 01:08:01,199 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 60 selfloop transitions, 18 changer transitions 79/161 dead transitions. [2025-01-10 01:08:01,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 161 transitions, 1091 flow [2025-01-10 01:08:01,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 01:08:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-10 01:08:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 266 transitions. [2025-01-10 01:08:01,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32242424242424245 [2025-01-10 01:08:01,201 INFO L175 Difference]: Start difference. First operand has 93 places, 80 transitions, 443 flow. Second operand 11 states and 266 transitions. [2025-01-10 01:08:01,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 161 transitions, 1091 flow [2025-01-10 01:08:01,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 161 transitions, 1085 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-01-10 01:08:01,217 INFO L231 Difference]: Finished difference. Result has 109 places, 82 transitions, 523 flow [2025-01-10 01:08:01,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=523, PETRI_PLACES=109, PETRI_TRANSITIONS=82} [2025-01-10 01:08:01,218 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 37 predicate places. [2025-01-10 01:08:01,218 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 82 transitions, 523 flow [2025-01-10 01:08:01,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.5) internal successors, (351), 18 states have internal predecessors, (351), 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:08:01,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:01,219 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:01,228 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:08:01,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:01,420 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:08:01,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1059335112, now seen corresponding path program 5 times [2025-01-10 01:08:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:01,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027419128] [2025-01-10 01:08:01,420 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:08:01,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:01,434 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 4 equivalence classes. [2025-01-10 01:08:01,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:08:01,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:08:01,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:08:01,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027419128] [2025-01-10 01:08:01,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027419128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138223131] [2025-01-10 01:08:01,586 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:08:01,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:01,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:01,588 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:08:01,591 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:08:01,679 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 4 equivalence classes. [2025-01-10 01:08:01,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 57 of 57 statements. [2025-01-10 01:08:01,745 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-10 01:08:01,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:01,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:08:01,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:01,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:08:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138223131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:08:01,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:08:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-10 01:08:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762403627] [2025-01-10 01:08:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:08:01,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:08:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:01,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:08:01,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:08:01,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:08:01,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 82 transitions, 523 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:08:01,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:01,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:08:01,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:02,077 INFO L124 PetriNetUnfolderBase]: 2345/3648 cut-off events. [2025-01-10 01:08:02,077 INFO L125 PetriNetUnfolderBase]: For 2669/2669 co-relation queries the response was YES. [2025-01-10 01:08:02,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8819 conditions, 3648 events. 2345/3648 cut-off events. For 2669/2669 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15768 event pairs, 2305 based on Foata normal form. 164/3174 useless extension candidates. Maximal degree in co-relation 8739. Up to 3588 conditions per place. [2025-01-10 01:08:02,097 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 62 selfloop transitions, 5 changer transitions 2/73 dead transitions. [2025-01-10 01:08:02,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 73 transitions, 583 flow [2025-01-10 01:08:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:08:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:08:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-01-10 01:08:02,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34 [2025-01-10 01:08:02,098 INFO L175 Difference]: Start difference. First operand has 109 places, 82 transitions, 523 flow. Second operand 4 states and 102 transitions. [2025-01-10 01:08:02,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 73 transitions, 583 flow [2025-01-10 01:08:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 73 transitions, 512 flow, removed 7 selfloop flow, removed 17 redundant places. [2025-01-10 01:08:02,105 INFO L231 Difference]: Finished difference. Result has 90 places, 68 transitions, 374 flow [2025-01-10 01:08:02,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2025-01-10 01:08:02,105 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2025-01-10 01:08:02,105 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 374 flow [2025-01-10 01:08:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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:08:02,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:02,106 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:02,113 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:08:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:02,306 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:08:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -549952613, now seen corresponding path program 6 times [2025-01-10 01:08:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658201732] [2025-01-10 01:08:02,307 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:08:02,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:02,323 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 4 equivalence classes. [2025-01-10 01:08:02,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 57 of 67 statements. [2025-01-10 01:08:02,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:08:02,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 01:08:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658201732] [2025-01-10 01:08:02,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658201732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:02,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314671520] [2025-01-10 01:08:02,556 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:08:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:02,558 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:08:02,561 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:08:02,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 4 equivalence classes. [2025-01-10 01:08:02,720 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 57 of 67 statements. [2025-01-10 01:08:02,720 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:08:02,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:02,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 01:08:02,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:02,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-10 01:08:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314671520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:03,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2025-01-10 01:08:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99687038] [2025-01-10 01:08:03,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:08:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:03,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:08:03,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:08:03,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:08:03,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 374 flow. Second operand has 13 states, 13 states have (on average 21.307692307692307) internal successors, (277), 13 states have internal predecessors, (277), 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:08:03,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:03,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:08:03,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:03,629 INFO L124 PetriNetUnfolderBase]: 3884/6043 cut-off events. [2025-01-10 01:08:03,629 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-01-10 01:08:03,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 6043 events. 3884/6043 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 29085 event pairs, 3272 based on Foata normal form. 10/4998 useless extension candidates. Maximal degree in co-relation 13055. Up to 2467 conditions per place. [2025-01-10 01:08:03,645 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 51 selfloop transitions, 19 changer transitions 62/136 dead transitions. [2025-01-10 01:08:03,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 136 transitions, 826 flow [2025-01-10 01:08:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:08:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:08:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 304 transitions. [2025-01-10 01:08:03,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3117948717948718 [2025-01-10 01:08:03,646 INFO L175 Difference]: Start difference. First operand has 90 places, 68 transitions, 374 flow. Second operand 13 states and 304 transitions. [2025-01-10 01:08:03,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 136 transitions, 826 flow [2025-01-10 01:08:03,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 136 transitions, 816 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 01:08:03,652 INFO L231 Difference]: Finished difference. Result has 102 places, 67 transitions, 401 flow [2025-01-10 01:08:03,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=401, PETRI_PLACES=102, PETRI_TRANSITIONS=67} [2025-01-10 01:08:03,652 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 30 predicate places. [2025-01-10 01:08:03,652 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 67 transitions, 401 flow [2025-01-10 01:08:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.307692307692307) internal successors, (277), 13 states have internal predecessors, (277), 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:08:03,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:03,653 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:03,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:03,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:03,856 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:08:03,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2022161630, now seen corresponding path program 7 times [2025-01-10 01:08:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:03,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726926462] [2025-01-10 01:08:03,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:08:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:03,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 01:08:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 01:08:03,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:03,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 01:08:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726926462] [2025-01-10 01:08:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726926462] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:04,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440179898] [2025-01-10 01:08:04,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:08:04,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:04,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:04,150 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:08:04,157 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:08:04,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-10 01:08:04,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-10 01:08:04,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:08:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:04,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:08:04,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:08:04,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 01:08:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440179898] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:04,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:04,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-01-10 01:08:04,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222836644] [2025-01-10 01:08:04,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:04,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 01:08:04,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:04,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 01:08:04,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2025-01-10 01:08:04,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:08:04,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 67 transitions, 401 flow. Second operand has 24 states, 24 states have (on average 18.791666666666668) internal successors, (451), 24 states have internal predecessors, (451), 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:08:04,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:04,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:08:04,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:05,469 INFO L124 PetriNetUnfolderBase]: 3900/6085 cut-off events. [2025-01-10 01:08:05,469 INFO L125 PetriNetUnfolderBase]: For 786/786 co-relation queries the response was YES. [2025-01-10 01:08:05,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13350 conditions, 6085 events. 3900/6085 cut-off events. For 786/786 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 29555 event pairs, 3441 based on Foata normal form. 2/5030 useless extension candidates. Maximal degree in co-relation 10595. Up to 3621 conditions per place. [2025-01-10 01:08:05,503 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 46 selfloop transitions, 19 changer transitions 91/160 dead transitions. [2025-01-10 01:08:05,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 160 transitions, 1102 flow [2025-01-10 01:08:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:08:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:08:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 328 transitions. [2025-01-10 01:08:05,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31238095238095237 [2025-01-10 01:08:05,505 INFO L175 Difference]: Start difference. First operand has 102 places, 67 transitions, 401 flow. Second operand 14 states and 328 transitions. [2025-01-10 01:08:05,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 160 transitions, 1102 flow [2025-01-10 01:08:05,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 160 transitions, 1058 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-01-10 01:08:05,513 INFO L231 Difference]: Finished difference. Result has 112 places, 69 transitions, 467 flow [2025-01-10 01:08:05,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=467, PETRI_PLACES=112, PETRI_TRANSITIONS=69} [2025-01-10 01:08:05,514 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 40 predicate places. [2025-01-10 01:08:05,514 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 69 transitions, 467 flow [2025-01-10 01:08:05,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 18.791666666666668) internal successors, (451), 24 states have internal predecessors, (451), 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:08:05,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:05,515 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:05,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 01:08:05,715 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,SelfDestructingSolverStorable24 [2025-01-10 01:08:05,715 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:08:05,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -917128842, now seen corresponding path program 8 times [2025-01-10 01:08:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:05,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887237250] [2025-01-10 01:08:05,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:05,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 01:08:05,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:08:05,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:05,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 01:08:05,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887237250] [2025-01-10 01:08:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887237250] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926508822] [2025-01-10 01:08:05,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:08:05,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:05,986 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:08:05,988 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:08:06,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 01:08:06,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 01:08:06,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:08:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:06,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 01:08:06,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:08:06,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:08:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-10 01:08:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926508822] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:08:06,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:08:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-01-10 01:08:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74484633] [2025-01-10 01:08:06,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:08:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-10 01:08:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:08:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-10 01:08:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2025-01-10 01:08:06,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 75 [2025-01-10 01:08:06,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 69 transitions, 467 flow. Second operand has 22 states, 22 states have (on average 21.045454545454547) internal successors, (463), 22 states have internal predecessors, (463), 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:08:06,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:08:06,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 75 [2025-01-10 01:08:06,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:08:07,660 INFO L124 PetriNetUnfolderBase]: 3986/6243 cut-off events. [2025-01-10 01:08:07,660 INFO L125 PetriNetUnfolderBase]: For 1267/1267 co-relation queries the response was YES. [2025-01-10 01:08:07,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 6243 events. 3986/6243 cut-off events. For 1267/1267 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 30519 event pairs, 2412 based on Foata normal form. 56/5217 useless extension candidates. Maximal degree in co-relation 13881. Up to 2403 conditions per place. [2025-01-10 01:08:07,688 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 52 selfloop transitions, 22 changer transitions 91/169 dead transitions. [2025-01-10 01:08:07,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 169 transitions, 1179 flow [2025-01-10 01:08:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 01:08:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-10 01:08:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 420 transitions. [2025-01-10 01:08:07,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29473684210526313 [2025-01-10 01:08:07,690 INFO L175 Difference]: Start difference. First operand has 112 places, 69 transitions, 467 flow. Second operand 19 states and 420 transitions. [2025-01-10 01:08:07,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 169 transitions, 1179 flow [2025-01-10 01:08:07,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 169 transitions, 1149 flow, removed 12 selfloop flow, removed 9 redundant places. [2025-01-10 01:08:07,699 INFO L231 Difference]: Finished difference. Result has 120 places, 71 transitions, 543 flow [2025-01-10 01:08:07,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=543, PETRI_PLACES=120, PETRI_TRANSITIONS=71} [2025-01-10 01:08:07,699 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 48 predicate places. [2025-01-10 01:08:07,700 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 71 transitions, 543 flow [2025-01-10 01:08:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 21.045454545454547) internal successors, (463), 22 states have internal predecessors, (463), 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:08:07,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:08:07,700 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:08:07,707 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:08:07,901 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,SelfDestructingSolverStorable25 [2025-01-10 01:08:07,901 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2025-01-10 01:08:07,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:08:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1087143873, now seen corresponding path program 9 times [2025-01-10 01:08:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:08:07,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195796589] [2025-01-10 01:08:07,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:08:07,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 5 equivalence classes. [2025-01-10 01:08:08,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 67 of 73 statements. [2025-01-10 01:08:08,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:08:08,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:08:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:08:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195796589] [2025-01-10 01:08:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195796589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:08:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590677563] [2025-01-10 01:08:10,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:08:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:08:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:08:10,904 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:08:10,906 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:08:11,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 5 equivalence classes. [2025-01-10 01:08:11,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 67 of 73 statements. [2025-01-10 01:08:11,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-10 01:08:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:08:11,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-10 01:08:11,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:08:11,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-01-10 01:08:14,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,214 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-10 01:08:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 01:08:14,306 INFO L349 Elim1Store]: treesize reduction 130, result has 50.6 percent of original size [2025-01-10 01:08:14,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 14 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 147 treesize of output 164 [2025-01-10 01:08:14,404 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 01:08:14,404 INFO L312 TraceCheckSpWp]: Computing backward predicates...