./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-le-max.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 dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:10:03,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:10:03,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:10:03,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:10:03,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:10:03,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:10:03,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:10:03,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:10:03,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:10:03,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:10:03,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:10:03,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:10:03,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:10:03,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:10:03,861 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:10:03,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:10:03,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:10:03,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:10:03,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:03,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:03,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:10:03,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:10:03,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:10:03,864 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 -> dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af [2025-01-10 01:10:04,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:10:04,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:10:04,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:10:04,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:10:04,176 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:10:04,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-01-10 01:10:05,546 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80e37b85d/b7c85c452ac84c7191d5159a945a9838/FLAGb4ea73b4d [2025-01-10 01:10:05,830 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:10:05,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-01-10 01:10:05,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80e37b85d/b7c85c452ac84c7191d5159a945a9838/FLAGb4ea73b4d [2025-01-10 01:10:06,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/80e37b85d/b7c85c452ac84c7191d5159a945a9838 [2025-01-10 01:10:06,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:10:06,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:10:06,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:06,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:10:06,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:10:06,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454ef207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06, skipping insertion in model container [2025-01-10 01:10:06,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:10:06,324 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:10:06,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:06,338 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:10:06,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:10:06,381 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:10:06,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06 WrapperNode [2025-01-10 01:10:06,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:10:06,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:06,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:10:06,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:10:06,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,411 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-01-10 01:10:06,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:10:06,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:10:06,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:10:06,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:10:06,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,433 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 01:10:06,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:10:06,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:10:06,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:10:06,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:10:06,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (1/1) ... [2025-01-10 01:10:06,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:10:06,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:06,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:10:06,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:10:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:10:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:10:06,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:10:06,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:10:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:10:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:10:06,510 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:10:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:10:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:10:06,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:10:06,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:10:06,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:10:06,514 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:10:06,602 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:10:06,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:10:06,969 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:10:06,970 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:10:07,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:10:07,246 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:10:07,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:07 BoogieIcfgContainer [2025-01-10 01:10:07,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:10:07,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:10:07,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:10:07,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:10:07,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:10:06" (1/3) ... [2025-01-10 01:10:07,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503abf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:07, skipping insertion in model container [2025-01-10 01:10:07,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:10:06" (2/3) ... [2025-01-10 01:10:07,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@503abf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:10:07, skipping insertion in model container [2025-01-10 01:10:07,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:07" (3/3) ... [2025-01-10 01:10:07,262 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2025-01-10 01:10:07,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:10:07,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-le-max.wvr.c that has 4 procedures, 48 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-01-10 01:10:07,279 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:10:07,356 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 01:10:07,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 121 flow [2025-01-10 01:10:07,439 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2025-01-10 01:10:07,443 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 01:10:07,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 3/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 109 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-01-10 01:10:07,449 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 121 flow [2025-01-10 01:10:07,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 110 flow [2025-01-10 01:10:07,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:10:07,477 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;@63496df7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:10:07,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-01-10 01:10:07,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:10:07,483 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:10:07,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:07,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:07,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:07,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash 421676, now seen corresponding path program 1 times [2025-01-10 01:10:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-01-10 01:10:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:07,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:07,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:07,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:07,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434841002] [2025-01-10 01:10:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434841002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:10:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434882559] [2025-01-10 01:10:07,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:07,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:07,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:07,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:07,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:07,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:07,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:07,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:07,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:08,095 INFO L124 PetriNetUnfolderBase]: 465/793 cut-off events. [2025-01-10 01:10:08,095 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 01:10:08,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 793 events. 465/793 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4002 event pairs, 388 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 1501. Up to 712 conditions per place. [2025-01-10 01:10:08,109 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-01-10 01:10:08,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 154 flow [2025-01-10 01:10:08,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-01-10 01:10:08,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-01-10 01:10:08,126 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 110 flow. Second operand 3 states and 77 transitions. [2025-01-10 01:10:08,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 154 flow [2025-01-10 01:10:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 142 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 01:10:08,138 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 88 flow [2025-01-10 01:10:08,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-01-10 01:10:08,146 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2025-01-10 01:10:08,146 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 88 flow [2025-01-10 01:10:08,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:08,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:08,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:08,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:10:08,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:08,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:08,148 INFO L85 PathProgramCache]: Analyzing trace with hash 421677, now seen corresponding path program 1 times [2025-01-10 01:10:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-01-10 01:10:08,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:08,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:08,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:08,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:08,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-01-10 01:10:08,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356672035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:08,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:08,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:08,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322524312] [2025-01-10 01:10:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:08,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:08,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:08,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:08,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:08,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:08,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:08,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:08,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:08,715 INFO L124 PetriNetUnfolderBase]: 466/796 cut-off events. [2025-01-10 01:10:08,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:08,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1563 conditions, 796 events. 466/796 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4016 event pairs, 388 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 1541. Up to 717 conditions per place. [2025-01-10 01:10:08,723 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 29 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-01-10 01:10:08,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 162 flow [2025-01-10 01:10:08,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-01-10 01:10:08,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-01-10 01:10:08,725 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 88 flow. Second operand 4 states and 90 transitions. [2025-01-10 01:10:08,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 162 flow [2025-01-10 01:10:08,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:08,729 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 111 flow [2025-01-10 01:10:08,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2025-01-10 01:10:08,731 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-01-10 01:10:08,732 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 111 flow [2025-01-10 01:10:08,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:08,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:08,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:10:08,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:08,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 421674, now seen corresponding path program 1 times [2025-01-10 01:10:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:08,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-01-10 01:10:08,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:08,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:08,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965858251] [2025-01-10 01:10:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965858251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381455589] [2025-01-10 01:10:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:08,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:08,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:08,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-01-10 01:10:08,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:08,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:08,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-01-10 01:10:08,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:08,993 INFO L124 PetriNetUnfolderBase]: 329/565 cut-off events. [2025-01-10 01:10:08,993 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:08,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 565 events. 329/565 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2568 event pairs, 263 based on Foata normal form. 0/460 useless extension candidates. Maximal degree in co-relation 1098. Up to 505 conditions per place. [2025-01-10 01:10:09,000 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 27 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-01-10 01:10:09,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 163 flow [2025-01-10 01:10:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-01-10 01:10:09,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.395 [2025-01-10 01:10:09,003 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 111 flow. Second operand 4 states and 79 transitions. [2025-01-10 01:10:09,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 163 flow [2025-01-10 01:10:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:09,005 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 106 flow [2025-01-10 01:10:09,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-10 01:10:09,007 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-01-10 01:10:09,008 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 106 flow [2025-01-10 01:10:09,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:09,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:09,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:10:09,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:10:09,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:09,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:09,009 INFO L85 PathProgramCache]: Analyzing trace with hash 421675, now seen corresponding path program 1 times [2025-01-10 01:10:09,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:09,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-01-10 01:10:09,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:09,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:09,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:10:09,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:10:09,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:09,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:09,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:09,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102739613] [2025-01-10 01:10:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102739613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:09,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:09,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:10:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793646219] [2025-01-10 01:10:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:09,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:10:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:10:09,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:10:09,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-01-10 01:10:09,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:10:09,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:09,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-01-10 01:10:09,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:09,234 INFO L124 PetriNetUnfolderBase]: 328/564 cut-off events. [2025-01-10 01:10:09,235 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 01:10:09,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 564 events. 328/564 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2542 event pairs, 263 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1098. Up to 508 conditions per place. [2025-01-10 01:10:09,239 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 27 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-01-10 01:10:09,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 158 flow [2025-01-10 01:10:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:10:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:10:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-01-10 01:10:09,241 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:10:09,241 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 106 flow. Second operand 3 states and 75 transitions. [2025-01-10 01:10:09,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 158 flow [2025-01-10 01:10:09,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:09,243 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 101 flow [2025-01-10 01:10:09,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-01-10 01:10:09,243 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-01-10 01:10:09,244 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 101 flow [2025-01-10 01:10:09,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:10:09,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:09,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 01:10:09,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:10:09,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:09,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 405244847, now seen corresponding path program 1 times [2025-01-10 01:10:09,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:09,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835109294] [2025-01-10 01:10:09,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:09,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:09,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:09,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:09,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:09,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:09,402 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:10:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835109294] [2025-01-10 01:10:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835109294] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16005621] [2025-01-10 01:10:09,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:09,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:10:09,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:09,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:09,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:09,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:09,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 01:10:09,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:09,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:09,561 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:10:09,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:09,623 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:10:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16005621] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:09,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-10 01:10:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-10 01:10:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708557044] [2025-01-10 01:10:09,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:09,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:10:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:09,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:10:09,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:10:09,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-01-10 01:10:09,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:09,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:09,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-01-10 01:10:09,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:09,778 INFO L124 PetriNetUnfolderBase]: 328/562 cut-off events. [2025-01-10 01:10:09,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:09,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 562 events. 328/562 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2542 event pairs, 263 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 1101. Up to 504 conditions per place. [2025-01-10 01:10:09,783 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 26 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-01-10 01:10:09,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 155 flow [2025-01-10 01:10:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:10:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:10:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-01-10 01:10:09,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.384 [2025-01-10 01:10:09,786 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 101 flow. Second operand 5 states and 96 transitions. [2025-01-10 01:10:09,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 155 flow [2025-01-10 01:10:09,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:09,787 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 99 flow [2025-01-10 01:10:09,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-01-10 01:10:09,788 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-01-10 01:10:09,788 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 99 flow [2025-01-10 01:10:09,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:09,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:09,788 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:10:09,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:10:09,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:10,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:10,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash 405244849, now seen corresponding path program 1 times [2025-01-10 01:10:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:10,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-01-10 01:10:10,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:10,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:10,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:10,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:10,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405973091] [2025-01-10 01:10:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405973091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4485315] [2025-01-10 01:10:10,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:10,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:10,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:10,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:10:10,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:10:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:10:10,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:10,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:10,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 01:10:10,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:10,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:10,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:10:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4485315] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:10:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281905579] [2025-01-10 01:10:10,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:10:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:10:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:10:10,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:10,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 99 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:10,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:10,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:10,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:11,014 INFO L124 PetriNetUnfolderBase]: 328/561 cut-off events. [2025-01-10 01:10:11,015 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:11,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 561 events. 328/561 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2557 event pairs, 263 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 1097. Up to 505 conditions per place. [2025-01-10 01:10:11,020 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 23 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2025-01-10 01:10:11,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 153 flow [2025-01-10 01:10:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:10:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:10:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-01-10 01:10:11,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-01-10 01:10:11,021 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 99 flow. Second operand 6 states and 114 transitions. [2025-01-10 01:10:11,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 153 flow [2025-01-10 01:10:11,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:11,023 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 104 flow [2025-01-10 01:10:11,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2025-01-10 01:10:11,023 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-01-10 01:10:11,024 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 104 flow [2025-01-10 01:10:11,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:11,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:11,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:11,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:10:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:11,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:11,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:11,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1544102424, now seen corresponding path program 1 times [2025-01-10 01:10:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948313281] [2025-01-10 01:10:11,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:11,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:10:11,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:10:11,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:11,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:11,314 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:10:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948313281] [2025-01-10 01:10:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948313281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:11,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031110834] [2025-01-10 01:10:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:11,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:11,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:11,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:11,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-01-10 01:10:11,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:11,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:11,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-01-10 01:10:11,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:11,478 INFO L124 PetriNetUnfolderBase]: 484/813 cut-off events. [2025-01-10 01:10:11,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:10:11,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 813 events. 484/813 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3973 event pairs, 263 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 1583. Up to 535 conditions per place. [2025-01-10 01:10:11,484 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 39 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2025-01-10 01:10:11,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 220 flow [2025-01-10 01:10:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-01-10 01:10:11,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-01-10 01:10:11,486 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 104 flow. Second operand 4 states and 94 transitions. [2025-01-10 01:10:11,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 220 flow [2025-01-10 01:10:11,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 192 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-01-10 01:10:11,488 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 97 flow [2025-01-10 01:10:11,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-01-10 01:10:11,489 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-01-10 01:10:11,489 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 97 flow [2025-01-10 01:10:11,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:11,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:11,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:11,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:10:11,489 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:11,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2094420816, now seen corresponding path program 1 times [2025-01-10 01:10:11,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720136698] [2025-01-10 01:10:11,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:11,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:10:11,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:10:11,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:11,567 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:10:11,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:11,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720136698] [2025-01-10 01:10:11,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720136698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:11,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:10:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277696751] [2025-01-10 01:10:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:11,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:11,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:11,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:11,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:11,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-01-10 01:10:11,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:11,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:11,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-01-10 01:10:11,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:11,769 INFO L124 PetriNetUnfolderBase]: 714/1175 cut-off events. [2025-01-10 01:10:11,769 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-01-10 01:10:11,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1175 events. 714/1175 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5758 event pairs, 329 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 2620. Up to 767 conditions per place. [2025-01-10 01:10:11,780 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2025-01-10 01:10:11,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 236 flow [2025-01-10 01:10:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:11,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-01-10 01:10:11,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.465 [2025-01-10 01:10:11,781 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 97 flow. Second operand 4 states and 93 transitions. [2025-01-10 01:10:11,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 236 flow [2025-01-10 01:10:11,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:11,783 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 113 flow [2025-01-10 01:10:11,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-10 01:10:11,784 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-01-10 01:10:11,784 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 113 flow [2025-01-10 01:10:11,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:11,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:11,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:10:11,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1256067520, now seen corresponding path program 1 times [2025-01-10 01:10:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201461295] [2025-01-10 01:10:11,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:11,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:10:11,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:10:11,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:11,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:11,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:11,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201461295] [2025-01-10 01:10:11,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201461295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:11,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730622643] [2025-01-10 01:10:11,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:11,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:11,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:11,939 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:11,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:10:11,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:10:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:10:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:12,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:12,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:12,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:12,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730622643] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:12,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:12,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:10:12,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068505017] [2025-01-10 01:10:12,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:12,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:10:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:12,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:10:12,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:10:12,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:12,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 113 flow. Second operand has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 14 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:12,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:12,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:12,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:12,590 INFO L124 PetriNetUnfolderBase]: 1475/2299 cut-off events. [2025-01-10 01:10:12,591 INFO L125 PetriNetUnfolderBase]: For 854/854 co-relation queries the response was YES. [2025-01-10 01:10:12,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5807 conditions, 2299 events. 1475/2299 cut-off events. For 854/854 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11989 event pairs, 834 based on Foata normal form. 44/2283 useless extension candidates. Maximal degree in co-relation 3499. Up to 1317 conditions per place. [2025-01-10 01:10:12,606 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 79 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-01-10 01:10:12,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 468 flow [2025-01-10 01:10:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2025-01-10 01:10:12,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-01-10 01:10:12,609 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 113 flow. Second operand 8 states and 192 transitions. [2025-01-10 01:10:12,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 468 flow [2025-01-10 01:10:12,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:10:12,613 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 182 flow [2025-01-10 01:10:12,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2025-01-10 01:10:12,613 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-01-10 01:10:12,614 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 182 flow [2025-01-10 01:10:12,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.142857142857142) internal successors, (226), 14 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:12,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:12,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:12,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 01:10:12,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:12,816 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1901123697, now seen corresponding path program 1 times [2025-01-10 01:10:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244862716] [2025-01-10 01:10:12,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:12,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:10:12,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:12,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:12,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:12,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244862716] [2025-01-10 01:10:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244862716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912784123] [2025-01-10 01:10:12,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:12,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:12,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:12,952 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:12,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 01:10:13,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 01:10:13,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:13,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:13,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:13,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:10:13,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:13,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:10:13,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912784123] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:13,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:13,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 01:10:13,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322039021] [2025-01-10 01:10:13,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:13,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 01:10:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:13,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 01:10:13,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-10 01:10:13,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:13,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 182 flow. Second operand has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:13,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:13,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:13,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:13,571 INFO L124 PetriNetUnfolderBase]: 1290/1981 cut-off events. [2025-01-10 01:10:13,572 INFO L125 PetriNetUnfolderBase]: For 1794/1844 co-relation queries the response was YES. [2025-01-10 01:10:13,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 1981 events. 1290/1981 cut-off events. For 1794/1844 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9930 event pairs, 791 based on Foata normal form. 32/1962 useless extension candidates. Maximal degree in co-relation 3575. Up to 1319 conditions per place. [2025-01-10 01:10:13,586 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 71 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2025-01-10 01:10:13,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 490 flow [2025-01-10 01:10:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:10:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:10:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2025-01-10 01:10:13,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4675 [2025-01-10 01:10:13,589 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 182 flow. Second operand 8 states and 187 transitions. [2025-01-10 01:10:13,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 490 flow [2025-01-10 01:10:13,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 482 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-01-10 01:10:13,597 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 233 flow [2025-01-10 01:10:13,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-01-10 01:10:13,598 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-01-10 01:10:13,598 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 233 flow [2025-01-10 01:10:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.285714285714285) internal successors, (228), 14 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:13,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:13,599 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:13,607 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:10:13,800 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,SelfDestructingSolverStorable9 [2025-01-10 01:10:13,800 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:13,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 926439748, now seen corresponding path program 2 times [2025-01-10 01:10:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-01-10 01:10:13,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:13,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:10:13,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:13,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:13,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-01-10 01:10:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162665499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593526024] [2025-01-10 01:10:14,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:14,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:14,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:14,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:14,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 01:10:14,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-01-10 01:10:14,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 01:10:14,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:14,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:14,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 01:10:14,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:14,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-10 01:10:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:14,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593526024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:14,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:14,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-01-10 01:10:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181813688] [2025-01-10 01:10:14,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:10:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:14,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:10:14,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:10:14,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-01-10 01:10:14,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 233 flow. Second operand has 21 states, 21 states have (on average 13.095238095238095) internal successors, (275), 21 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:14,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:14,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-01-10 01:10:14,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:15,787 INFO L124 PetriNetUnfolderBase]: 1515/2281 cut-off events. [2025-01-10 01:10:15,787 INFO L125 PetriNetUnfolderBase]: For 2148/2198 co-relation queries the response was YES. [2025-01-10 01:10:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 2281 events. 1515/2281 cut-off events. For 2148/2198 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11514 event pairs, 232 based on Foata normal form. 88/2327 useless extension candidates. Maximal degree in co-relation 4737. Up to 455 conditions per place. [2025-01-10 01:10:15,804 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 133 selfloop transitions, 18 changer transitions 0/155 dead transitions. [2025-01-10 01:10:15,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 929 flow [2025-01-10 01:10:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:10:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:10:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 293 transitions. [2025-01-10 01:10:15,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4185714285714286 [2025-01-10 01:10:15,806 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 233 flow. Second operand 14 states and 293 transitions. [2025-01-10 01:10:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 929 flow [2025-01-10 01:10:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 155 transitions, 910 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 01:10:15,814 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 281 flow [2025-01-10 01:10:15,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=281, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2025-01-10 01:10:15,817 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-01-10 01:10:15,817 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 281 flow [2025-01-10 01:10:15,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.095238095238095) internal successors, (275), 21 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:15,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:15,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:15,826 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:10:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:10:16,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:16,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1338552587, now seen corresponding path program 2 times [2025-01-10 01:10:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235028465] [2025-01-10 01:10:16,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:16,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:10:16,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:10:16,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:16,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 01:10:16,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:16,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235028465] [2025-01-10 01:10:16,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235028465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:10:16,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782285665] [2025-01-10 01:10:16,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:10:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:10:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:10:16,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:10:16,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 01:10:16,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-10 01:10:16,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 01:10:16,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:10:16,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:16,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-10 01:10:16,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:10:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:16,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:10:16,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-10 01:10:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:10:16,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782285665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:10:16,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:10:16,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-01-10 01:10:16,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113231668] [2025-01-10 01:10:16,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:10:16,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-10 01:10:16,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:16,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-10 01:10:16,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-01-10 01:10:16,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-01-10 01:10:16,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 281 flow. Second operand has 21 states, 21 states have (on average 14.380952380952381) internal successors, (302), 21 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:16,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:16,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-01-10 01:10:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:18,023 INFO L124 PetriNetUnfolderBase]: 1734/2584 cut-off events. [2025-01-10 01:10:18,023 INFO L125 PetriNetUnfolderBase]: For 4882/4990 co-relation queries the response was YES. [2025-01-10 01:10:18,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8461 conditions, 2584 events. 1734/2584 cut-off events. For 4882/4990 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12351 event pairs, 260 based on Foata normal form. 100/2653 useless extension candidates. Maximal degree in co-relation 6164. Up to 485 conditions per place. [2025-01-10 01:10:18,047 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 131 selfloop transitions, 18 changer transitions 0/155 dead transitions. [2025-01-10 01:10:18,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 155 transitions, 1075 flow [2025-01-10 01:10:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 01:10:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 01:10:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 295 transitions. [2025-01-10 01:10:18,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2025-01-10 01:10:18,049 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 281 flow. Second operand 14 states and 295 transitions. [2025-01-10 01:10:18,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 155 transitions, 1075 flow [2025-01-10 01:10:18,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 155 transitions, 868 flow, removed 43 selfloop flow, removed 11 redundant places. [2025-01-10 01:10:18,059 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 283 flow [2025-01-10 01:10:18,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=283, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2025-01-10 01:10:18,060 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2025-01-10 01:10:18,060 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 283 flow [2025-01-10 01:10:18,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.380952380952381) internal successors, (302), 21 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:18,060 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:10:18,070 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:10:18,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 01:10:18,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:18,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:18,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2128725354, now seen corresponding path program 1 times [2025-01-10 01:10:18,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:18,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-01-10 01:10:18,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:18,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:18,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 01:10:18,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 01:10:18,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:18,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:18,330 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:10:18,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:18,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61549504] [2025-01-10 01:10:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61549504] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911383377] [2025-01-10 01:10:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:18,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:18,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:18,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:18,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-01-10 01:10:18,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:18,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-01-10 01:10:18,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:18,529 INFO L124 PetriNetUnfolderBase]: 1256/2085 cut-off events. [2025-01-10 01:10:18,529 INFO L125 PetriNetUnfolderBase]: For 3264/3304 co-relation queries the response was YES. [2025-01-10 01:10:18,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 2085 events. 1256/2085 cut-off events. For 3264/3304 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10906 event pairs, 516 based on Foata normal form. 82/2125 useless extension candidates. Maximal degree in co-relation 4946. Up to 1347 conditions per place. [2025-01-10 01:10:18,545 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 57 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2025-01-10 01:10:18,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 72 transitions, 513 flow [2025-01-10 01:10:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:18,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-01-10 01:10:18,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-01-10 01:10:18,548 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 283 flow. Second operand 4 states and 98 transitions. [2025-01-10 01:10:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 72 transitions, 513 flow [2025-01-10 01:10:18,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 415 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-01-10 01:10:18,557 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 230 flow [2025-01-10 01:10:18,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2025-01-10 01:10:18,559 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2025-01-10 01:10:18,559 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 230 flow [2025-01-10 01:10:18,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:18,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:18,560 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:10:18,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:10:18,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:18,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1236960394, now seen corresponding path program 1 times [2025-01-10 01:10:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951603592] [2025-01-10 01:10:18,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:18,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 01:10:18,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 01:10:18,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:18,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:18,624 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:10:18,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:18,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951603592] [2025-01-10 01:10:18,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951603592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:10:18,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923440684] [2025-01-10 01:10:18,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:10:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:18,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:10:18,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:10:18,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-01-10 01:10:18,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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:10:18,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:18,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-01-10 01:10:18,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:18,799 INFO L124 PetriNetUnfolderBase]: 1174/2002 cut-off events. [2025-01-10 01:10:18,799 INFO L125 PetriNetUnfolderBase]: For 1791/1853 co-relation queries the response was YES. [2025-01-10 01:10:18,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 2002 events. 1174/2002 cut-off events. For 1791/1853 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 11195 event pairs, 673 based on Foata normal form. 82/2051 useless extension candidates. Maximal degree in co-relation 4247. Up to 1285 conditions per place. [2025-01-10 01:10:18,815 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 52 selfloop transitions, 6 changer transitions 0/67 dead transitions. [2025-01-10 01:10:18,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 405 flow [2025-01-10 01:10:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:10:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:10:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-01-10 01:10:18,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.485 [2025-01-10 01:10:18,816 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 230 flow. Second operand 4 states and 97 transitions. [2025-01-10 01:10:18,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 405 flow [2025-01-10 01:10:18,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 385 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:18,821 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 221 flow [2025-01-10 01:10:18,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-01-10 01:10:18,823 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2025-01-10 01:10:18,823 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 221 flow [2025-01-10 01:10:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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:10:18,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:10:18,823 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] [2025-01-10 01:10:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:10:18,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-01-10 01:10:18,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:10:18,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1917717485, now seen corresponding path program 1 times [2025-01-10 01:10:18,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:10:18,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564336615] [2025-01-10 01:10:18,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:10:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:10:18,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 01:10:18,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 01:10:18,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:10:18,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:10:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 01:10:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:10:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564336615] [2025-01-10 01:10:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564336615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:10:19,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:10:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:10:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4296161] [2025-01-10 01:10:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:10:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:10:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:10:19,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:10:19,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:10:19,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-01-10 01:10:19,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 221 flow. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:19,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:10:19,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-01-10 01:10:19,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:10:19,439 INFO L124 PetriNetUnfolderBase]: 1659/2570 cut-off events. [2025-01-10 01:10:19,440 INFO L125 PetriNetUnfolderBase]: For 2449/2539 co-relation queries the response was YES. [2025-01-10 01:10:19,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7053 conditions, 2570 events. 1659/2570 cut-off events. For 2449/2539 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12382 event pairs, 183 based on Foata normal form. 2/2562 useless extension candidates. Maximal degree in co-relation 5317. Up to 1046 conditions per place. [2025-01-10 01:10:19,446 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 116/116 dead transitions. [2025-01-10 01:10:19,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 116 transitions, 712 flow [2025-01-10 01:10:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:10:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:10:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-01-10 01:10:19,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.414 [2025-01-10 01:10:19,448 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 221 flow. Second operand 10 states and 207 transitions. [2025-01-10 01:10:19,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 116 transitions, 712 flow [2025-01-10 01:10:19,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 676 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:10:19,452 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2025-01-10 01:10:19,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=71, PETRI_TRANSITIONS=0} [2025-01-10 01:10:19,453 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2025-01-10 01:10:19,453 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2025-01-10 01:10:19,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:10:19,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-01-10 01:10:19,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-01-10 01:10:19,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (11 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-01-10 01:10:19,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-01-10 01:10:19,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-01-10 01:10:19,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-01-10 01:10:19,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-01-10 01:10:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:10:19,458 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:10:19,463 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 01:10:19,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:10:19,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:10:19 BasicIcfg [2025-01-10 01:10:19,467 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:10:19,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:10:19,468 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:10:19,468 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:10:19,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:10:07" (3/4) ... [2025-01-10 01:10:19,470 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:10:19,472 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 01:10:19,472 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 01:10:19,472 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-10 01:10:19,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 91 nodes and edges [2025-01-10 01:10:19,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-10 01:10:19,477 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 01:10:19,477 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 01:10:19,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:10:19,550 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:10:19,550 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:10:19,552 INFO L158 Benchmark]: Toolchain (without parser) took 13432.76ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.9MB in the beginning and 159.9MB in the end (delta: -47.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-01-10 01:10:19,552 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:10:19,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.64ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:10:19,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.69ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 955.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:10:19,552 INFO L158 Benchmark]: Boogie Preprocessor took 35.90ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:10:19,553 INFO L158 Benchmark]: RCFGBuilder took 797.62ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 58.4MB in the end (delta: 39.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-10 01:10:19,553 INFO L158 Benchmark]: TraceAbstraction took 12214.71ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.7MB in the beginning and 164.3MB in the end (delta: -106.6MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2025-01-10 01:10:19,553 INFO L158 Benchmark]: Witness Printer took 82.48ms. Allocated memory is still 218.1MB. Free memory was 164.3MB in the beginning and 159.9MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:10:19,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.64ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.7MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.69ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 99.8MB in the end (delta: 955.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.90ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.7MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 797.62ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 58.4MB in the end (delta: 39.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12214.71ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 57.7MB in the beginning and 164.3MB in the end (delta: -106.6MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * Witness Printer took 82.48ms. Allocated memory is still 218.1MB. Free memory was 164.3MB in the beginning and 159.9MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 78]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 73 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.1s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1099 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 986 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 440 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5340 IncrementalHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 38 mSDtfsCounter, 5340 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=12, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 2517 SizeOfPredicates, 17 NumberOfNonLiveVariables, 659 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 27 InterpolantComputations, 10 PerfectInterpolantSequences, 129/180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 01:10:19,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE