./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 c00e63dc 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-?-c00e63d-m [2025-02-06 13:09:05,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 13:09:05,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 13:09:05,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 13:09:05,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 13:09:05,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 13:09:05,624 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 13:09:05,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 13:09:05,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 13:09:05,625 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 13:09:05,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 13:09:05,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 13:09:05,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 13:09:05,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 13:09:05,625 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 13:09:05,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 13:09:05,626 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 13:09:05,627 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 13:09:05,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:05,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 13:09:05,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 13:09:05,628 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-02-06 13:09:05,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 13:09:05,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 13:09:05,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 13:09:05,828 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 13:09:05,828 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 13:09:05,829 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-02-06 13:09:06,992 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f2b85ba/0d45e060144a4b0ebb8a1711eb6147bc/FLAGf12d8d4ea [2025-02-06 13:09:07,223 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 13:09:07,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-02-06 13:09:07,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f2b85ba/0d45e060144a4b0ebb8a1711eb6147bc/FLAGf12d8d4ea [2025-02-06 13:09:07,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b1f2b85ba/0d45e060144a4b0ebb8a1711eb6147bc [2025-02-06 13:09:07,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 13:09:07,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 13:09:07,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:07,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 13:09:07,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 13:09:07,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07, skipping insertion in model container [2025-02-06 13:09:07,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 13:09:07,456 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 13:09:07,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:07,470 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 13:09:07,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 13:09:07,529 INFO L204 MainTranslator]: Completed translation [2025-02-06 13:09:07,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07 WrapperNode [2025-02-06 13:09:07,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 13:09:07,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:07,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 13:09:07,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 13:09:07,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,564 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2025-02-06 13:09:07,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 13:09:07,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 13:09:07,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 13:09:07,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 13:09:07,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,591 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-02-06 13:09:07,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 13:09:07,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 13:09:07,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 13:09:07,604 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 13:09:07,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (1/1) ... [2025-02-06 13:09:07,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 13:09:07,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:07,639 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-02-06 13:09:07,643 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-02-06 13:09:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 13:09:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 13:09:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 13:09:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 13:09:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 13:09:07,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 13:09:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 13:09:07,657 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 13:09:07,721 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 13:09:07,722 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 13:09:07,920 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 13:09:07,921 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 13:09:08,052 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 13:09:08,053 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 13:09:08,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:08 BoogieIcfgContainer [2025-02-06 13:09:08,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 13:09:08,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 13:09:08,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 13:09:08,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 13:09:08,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:07" (1/3) ... [2025-02-06 13:09:08,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d09431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:08, skipping insertion in model container [2025-02-06 13:09:08,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:07" (2/3) ... [2025-02-06 13:09:08,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73d09431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:08, skipping insertion in model container [2025-02-06 13:09:08,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:08" (3/3) ... [2025-02-06 13:09:08,062 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2025-02-06 13:09:08,073 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 13:09:08,074 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-02-06 13:09:08,074 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 13:09:08,134 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 13:09:08,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 121 flow [2025-02-06 13:09:08,186 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2025-02-06 13:09:08,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 13:09:08,191 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 101 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-02-06 13:09:08,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 121 flow [2025-02-06 13:09:08,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 110 flow [2025-02-06 13:09:08,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 13:09:08,215 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;@56f1b7cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 13:09:08,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-06 13:09:08,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 13:09:08,222 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-06 13:09:08,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 13:09:08,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:08,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:08,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:08,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:08,226 INFO L85 PathProgramCache]: Analyzing trace with hash 370546, now seen corresponding path program 1 times [2025-02-06 13:09:08,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:08,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923266929] [2025-02-06 13:09:08,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:08,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:08,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:08,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923266929] [2025-02-06 13:09:08,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923266929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:08,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:08,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 13:09:08,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839537183] [2025-02-06 13:09:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:08,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:08,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:08,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:08,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 13:09:08,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-06 13:09:08,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:08,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 13:09:08,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:08,688 INFO L124 PetriNetUnfolderBase]: 658/1036 cut-off events. [2025-02-06 13:09:08,689 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-06 13:09:08,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 1036 events. 658/1036 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5040 event pairs, 556 based on Foata normal form. 1/789 useless extension candidates. Maximal degree in co-relation 1976. Up to 984 conditions per place. [2025-02-06 13:09:08,696 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 28 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-02-06 13:09:08,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 156 flow [2025-02-06 13:09:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-02-06 13:09:08,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 13:09:08,709 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 110 flow. Second operand 3 states and 75 transitions. [2025-02-06 13:09:08,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 156 flow [2025-02-06 13:09:08,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 13:09:08,715 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 88 flow [2025-02-06 13:09:08,718 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-02-06 13:09:08,720 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2025-02-06 13:09:08,720 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 88 flow [2025-02-06 13:09:08,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-02-06 13:09:08,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:08,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:08,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 13:09:08,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:08,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 370547, now seen corresponding path program 1 times [2025-02-06 13:09:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337536501] [2025-02-06 13:09:08,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:08,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:08,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:08,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:08,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337536501] [2025-02-06 13:09:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337536501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:08,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119890893] [2025-02-06 13:09:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:08,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:08,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:08,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:08,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 13:09:08,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-06 13:09:08,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:08,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 13:09:08,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,084 INFO L124 PetriNetUnfolderBase]: 659/1039 cut-off events. [2025-02-06 13:09:09,084 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:09:09,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1039 events. 659/1039 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5046 event pairs, 556 based on Foata normal form. 0/791 useless extension candidates. Maximal degree in co-relation 2056. Up to 989 conditions per place. [2025-02-06 13:09:09,090 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 30 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-02-06 13:09:09,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 164 flow [2025-02-06 13:09:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-02-06 13:09:09,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-02-06 13:09:09,091 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 88 flow. Second operand 4 states and 87 transitions. [2025-02-06 13:09:09,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 164 flow [2025-02-06 13:09:09,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:09,093 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 111 flow [2025-02-06 13:09:09,093 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-02-06 13:09:09,093 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-02-06 13:09:09,093 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 111 flow [2025-02-06 13:09:09,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-02-06 13:09:09,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 13:09:09,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash 370594, now seen corresponding path program 1 times [2025-02-06 13:09:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132472272] [2025-02-06 13:09:09,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:09,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:09,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132472272] [2025-02-06 13:09:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132472272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036452225] [2025-02-06 13:09:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:09,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-06 13:09:09,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:09,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:09,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-06 13:09:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,295 INFO L124 PetriNetUnfolderBase]: 465/738 cut-off events. [2025-02-06 13:09:09,295 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:09:09,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 738 events. 465/738 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3222 event pairs, 378 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 1463. Up to 697 conditions per place. [2025-02-06 13:09:09,301 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 28 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-02-06 13:09:09,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 165 flow [2025-02-06 13:09:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-02-06 13:09:09,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38 [2025-02-06 13:09:09,304 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 111 flow. Second operand 4 states and 76 transitions. [2025-02-06 13:09:09,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 165 flow [2025-02-06 13:09:09,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 38 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:09,306 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 106 flow [2025-02-06 13:09:09,306 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-02-06 13:09:09,307 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-06 13:09:09,307 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 106 flow [2025-02-06 13:09:09,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:09,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 13:09:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 13:09:09,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 370595, now seen corresponding path program 1 times [2025-02-06 13:09:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045868252] [2025-02-06 13:09:09,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 13:09:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 13:09:09,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:09,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045868252] [2025-02-06 13:09:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045868252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:09,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:09,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 13:09:09,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677320122] [2025-02-06 13:09:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:09,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 13:09:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:09,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 13:09:09,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 13:09:09,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-06 13:09:09,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-02-06 13:09:09,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:09,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-06 13:09:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,439 INFO L124 PetriNetUnfolderBase]: 464/737 cut-off events. [2025-02-06 13:09:09,439 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 13:09:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 737 events. 464/737 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3207 event pairs, 378 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 1463. Up to 700 conditions per place. [2025-02-06 13:09:09,442 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-02-06 13:09:09,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 160 flow [2025-02-06 13:09:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 13:09:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 13:09:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-06 13:09:09,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4866666666666667 [2025-02-06 13:09:09,443 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 106 flow. Second operand 3 states and 73 transitions. [2025-02-06 13:09:09,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 160 flow [2025-02-06 13:09:09,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:09,444 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 101 flow [2025-02-06 13:09:09,444 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-02-06 13:09:09,445 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-06 13:09:09,445 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 101 flow [2025-02-06 13:09:09,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-02-06 13:09:09,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 13:09:09,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 13:09:09,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:09,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash 356107809, now seen corresponding path program 1 times [2025-02-06 13:09:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:09,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541459711] [2025-02-06 13:09:09,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:09,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:09,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:09,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:09,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541459711] [2025-02-06 13:09:09,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541459711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:09,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128309177] [2025-02-06 13:09:09,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:09,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:09,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:09,575 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-02-06 13:09:09,578 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-02-06 13:09:09,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:09,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 13:09:09,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:09,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-06 13:09:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128309177] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:09,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 13:09:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65905788] [2025-02-06 13:09:09,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:09,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 13:09:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:09,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 13:09:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:09:09,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 13:09:09,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 101 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-02-06 13:09:09,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:09,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 13:09:09,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:09,892 INFO L124 PetriNetUnfolderBase]: 464/735 cut-off events. [2025-02-06 13:09:09,892 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:09:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 735 events. 464/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3198 event pairs, 378 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1466. Up to 696 conditions per place. [2025-02-06 13:09:09,894 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 27 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2025-02-06 13:09:09,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 157 flow [2025-02-06 13:09:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 13:09:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 13:09:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2025-02-06 13:09:09,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.368 [2025-02-06 13:09:09,896 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 101 flow. Second operand 5 states and 92 transitions. [2025-02-06 13:09:09,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 157 flow [2025-02-06 13:09:09,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:09,897 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 99 flow [2025-02-06 13:09:09,897 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-02-06 13:09:09,897 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-06 13:09:09,897 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 99 flow [2025-02-06 13:09:09,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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-02-06 13:09:09,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:09,898 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-06 13:09:09,904 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-02-06 13:09:10,102 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-02-06 13:09:10,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 356107761, now seen corresponding path program 1 times [2025-02-06 13:09:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133410993] [2025-02-06 13:09:10,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:10,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:10,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:10,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:10,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:10,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133410993] [2025-02-06 13:09:10,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133410993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850746125] [2025-02-06 13:09:10,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:10,330 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-02-06 13:09:10,333 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-02-06 13:09:10,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 13:09:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 13:09:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:10,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 13:09:10,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:10,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-02-06 13:09:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:10,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850746125] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:10,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-06 13:09:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625346882] [2025-02-06 13:09:10,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 13:09:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:10,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 13:09:10,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 13:09:10,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 13:09:10,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 99 flow. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:10,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:10,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 13:09:10,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:10,948 INFO L124 PetriNetUnfolderBase]: 464/734 cut-off events. [2025-02-06 13:09:10,949 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:09:10,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 734 events. 464/734 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3200 event pairs, 378 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1462. Up to 697 conditions per place. [2025-02-06 13:09:10,953 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 24 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2025-02-06 13:09:10,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 155 flow [2025-02-06 13:09:10,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 13:09:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 13:09:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-02-06 13:09:10,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-02-06 13:09:10,954 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 99 flow. Second operand 6 states and 109 transitions. [2025-02-06 13:09:10,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 155 flow [2025-02-06 13:09:10,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:10,957 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 104 flow [2025-02-06 13:09:10,957 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-02-06 13:09:10,957 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-02-06 13:09:10,958 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 104 flow [2025-02-06 13:09:10,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:10,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:10,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:10,965 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-02-06 13:09:11,159 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-02-06 13:09:11,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1922071022, now seen corresponding path program 1 times [2025-02-06 13:09:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641757625] [2025-02-06 13:09:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:11,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:11,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:11,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:11,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:11,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641757625] [2025-02-06 13:09:11,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641757625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:11,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565649419] [2025-02-06 13:09:11,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:11,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:11,333 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-02-06 13:09:11,344 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-02-06 13:09:11,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 13:09:11,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 13:09:11,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:11,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:11,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:09:11,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:11,503 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:09:11,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565649419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:11,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:09:11,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-02-06 13:09:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685993239] [2025-02-06 13:09:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:11,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:11,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:11,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:09:11,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 13:09:11,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:11,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:11,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 13:09:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:11,783 INFO L124 PetriNetUnfolderBase]: 680/1056 cut-off events. [2025-02-06 13:09:11,783 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 13:09:11,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1056 events. 680/1056 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4812 event pairs, 286 based on Foata normal form. 0/924 useless extension candidates. Maximal degree in co-relation 2098. Up to 737 conditions per place. [2025-02-06 13:09:11,791 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 41 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2025-02-06 13:09:11,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 226 flow [2025-02-06 13:09:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-02-06 13:09:11,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46 [2025-02-06 13:09:11,795 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 104 flow. Second operand 4 states and 92 transitions. [2025-02-06 13:09:11,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 226 flow [2025-02-06 13:09:11,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 198 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-02-06 13:09:11,796 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 97 flow [2025-02-06 13:09:11,796 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-02-06 13:09:11,797 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-02-06 13:09:11,797 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 97 flow [2025-02-06 13:09:11,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:11,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:11,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:11,806 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-02-06 13:09:11,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:12,000 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 262027955, now seen corresponding path program 1 times [2025-02-06 13:09:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237940774] [2025-02-06 13:09:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:12,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:12,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:12,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:12,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 13:09:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237940774] [2025-02-06 13:09:12,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237940774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:12,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865823993] [2025-02-06 13:09:12,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:12,207 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-02-06 13:09:12,208 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-02-06 13:09:12,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 13:09:12,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 13:09:12,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:12,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 13:09:12,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:12,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 13:09:12,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865823993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:12,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 13:09:12,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 7 [2025-02-06 13:09:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228410969] [2025-02-06 13:09:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:12,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:12,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:12,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 13:09:12,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-02-06 13:09:12,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 97 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-02-06 13:09:12,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:12,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-02-06 13:09:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:12,518 INFO L124 PetriNetUnfolderBase]: 1003/1554 cut-off events. [2025-02-06 13:09:12,519 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-02-06 13:09:12,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3524 conditions, 1554 events. 1003/1554 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7533 event pairs, 536 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 3506. Up to 1054 conditions per place. [2025-02-06 13:09:12,527 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 44 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2025-02-06 13:09:12,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 242 flow [2025-02-06 13:09:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-02-06 13:09:12,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.455 [2025-02-06 13:09:12,528 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 97 flow. Second operand 4 states and 91 transitions. [2025-02-06 13:09:12,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 242 flow [2025-02-06 13:09:12,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:12,529 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 113 flow [2025-02-06 13:09:12,529 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-02-06 13:09:12,530 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2025-02-06 13:09:12,530 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 113 flow [2025-02-06 13:09:12,530 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-02-06 13:09:12,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:12,530 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:12,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-06 13:09:12,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -85715322, now seen corresponding path program 1 times [2025-02-06 13:09:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:12,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951345282] [2025-02-06 13:09:12,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:12,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:09:12,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:09:12,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:12,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:12,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951345282] [2025-02-06 13:09:12,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951345282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:12,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234896153] [2025-02-06 13:09:12,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:12,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:12,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:12,806 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-02-06 13:09:12,808 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-02-06 13:09:12,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 13:09:12,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 13:09:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:12,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:12,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:12,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234896153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:12,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:12,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549324758] [2025-02-06 13:09:12,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:12,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:12,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:12,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:12,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:12,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 13:09:12,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 113 flow. Second operand has 14 states, 14 states have (on average 15.142857142857142) internal successors, (212), 14 states have internal predecessors, (212), 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-02-06 13:09:12,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:12,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 13:09:12,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:13,298 INFO L124 PetriNetUnfolderBase]: 2076/3105 cut-off events. [2025-02-06 13:09:13,298 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2025-02-06 13:09:13,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 3105 events. 2076/3105 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15621 event pairs, 1197 based on Foata normal form. 58/3151 useless extension candidates. Maximal degree in co-relation 4714. Up to 1814 conditions per place. [2025-02-06 13:09:13,386 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 83 selfloop transitions, 10 changer transitions 0/96 dead transitions. [2025-02-06 13:09:13,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 96 transitions, 482 flow [2025-02-06 13:09:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-02-06 13:09:13,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-02-06 13:09:13,387 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 113 flow. Second operand 8 states and 188 transitions. [2025-02-06 13:09:13,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 96 transitions, 482 flow [2025-02-06 13:09:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 13:09:13,389 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 182 flow [2025-02-06 13:09:13,389 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-02-06 13:09:13,390 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2025-02-06 13:09:13,390 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 182 flow [2025-02-06 13:09:13,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.142857142857142) internal successors, (212), 14 states have internal predecessors, (212), 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-02-06 13:09:13,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:13,390 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:13,396 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-02-06 13:09:13,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:13,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:13,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2119698058, now seen corresponding path program 1 times [2025-02-06 13:09:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027166631] [2025-02-06 13:09:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:13,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:13,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:13,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027166631] [2025-02-06 13:09:13,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027166631] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:13,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752345738] [2025-02-06 13:09:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:13,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:13,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:13,663 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-02-06 13:09:13,664 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-02-06 13:09:13,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 13:09:13,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:13,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:13,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:13,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 13:09:13,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:13,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 13:09:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752345738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:13,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:13,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-06 13:09:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379148443] [2025-02-06 13:09:13,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:13,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 13:09:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 13:09:13,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-06 13:09:13,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2025-02-06 13:09:13,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 182 flow. Second operand has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 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-02-06 13:09:13,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:13,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2025-02-06 13:09:13,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:14,179 INFO L124 PetriNetUnfolderBase]: 1820/2688 cut-off events. [2025-02-06 13:09:14,180 INFO L125 PetriNetUnfolderBase]: For 2440/2508 co-relation queries the response was YES. [2025-02-06 13:09:14,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7350 conditions, 2688 events. 1820/2688 cut-off events. For 2440/2508 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12814 event pairs, 1132 based on Foata normal form. 43/2720 useless extension candidates. Maximal degree in co-relation 4835. Up to 1822 conditions per place. [2025-02-06 13:09:14,190 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 75 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2025-02-06 13:09:14,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 88 transitions, 504 flow [2025-02-06 13:09:14,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 13:09:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 13:09:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-02-06 13:09:14,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4575 [2025-02-06 13:09:14,192 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 182 flow. Second operand 8 states and 183 transitions. [2025-02-06 13:09:14,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 88 transitions, 504 flow [2025-02-06 13:09:14,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 496 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-02-06 13:09:14,195 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 233 flow [2025-02-06 13:09:14,196 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-02-06 13:09:14,197 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2025-02-06 13:09:14,197 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 233 flow [2025-02-06 13:09:14,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.285714285714286) internal successors, (214), 14 states have internal predecessors, (214), 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-02-06 13:09:14,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:14,197 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:14,203 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-02-06 13:09:14,397 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,SelfDestructingSolverStorable9 [2025-02-06 13:09:14,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:14,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash 882552708, now seen corresponding path program 2 times [2025-02-06 13:09:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290030098] [2025-02-06 13:09:14,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:14,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 13:09:14,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:14,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:14,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290030098] [2025-02-06 13:09:14,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290030098] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:14,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87775936] [2025-02-06 13:09:14,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:14,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:14,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 13:09:14,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-02-06 13:09:14,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 13:09:14,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:14,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:09:14,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:14,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:14,844 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-02-06 13:09:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:14,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87775936] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:14,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:14,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-02-06 13:09:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784891155] [2025-02-06 13:09:14,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:14,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:09:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:09:14,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:09:15,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-06 13:09:15,213 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-02-06 13:09:15,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:15,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-06 13:09:15,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:16,123 INFO L124 PetriNetUnfolderBase]: 2127/3109 cut-off events. [2025-02-06 13:09:16,123 INFO L125 PetriNetUnfolderBase]: For 3094/3167 co-relation queries the response was YES. [2025-02-06 13:09:16,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9260 conditions, 3109 events. 2127/3109 cut-off events. For 3094/3167 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14992 event pairs, 309 based on Foata normal form. 116/3215 useless extension candidates. Maximal degree in co-relation 6397. Up to 609 conditions per place. [2025-02-06 13:09:16,142 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 142 selfloop transitions, 18 changer transitions 0/163 dead transitions. [2025-02-06 13:09:16,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 163 transitions, 963 flow [2025-02-06 13:09:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:09:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:09:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 302 transitions. [2025-02-06 13:09:16,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43142857142857144 [2025-02-06 13:09:16,143 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 233 flow. Second operand 14 states and 302 transitions. [2025-02-06 13:09:16,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 163 transitions, 963 flow [2025-02-06 13:09:16,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 163 transitions, 944 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 13:09:16,150 INFO L231 Difference]: Finished difference. Result has 72 places, 52 transitions, 281 flow [2025-02-06 13:09:16,150 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-02-06 13:09:16,151 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2025-02-06 13:09:16,151 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 52 transitions, 281 flow [2025-02-06 13:09:16,152 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-02-06 13:09:16,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:16,152 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:16,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 13:09:16,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:16,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:16,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 617371656, now seen corresponding path program 2 times [2025-02-06 13:09:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665656900] [2025-02-06 13:09:16,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:16,361 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:16,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:16,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:16,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665656900] [2025-02-06 13:09:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665656900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 13:09:16,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335614771] [2025-02-06 13:09:16,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 13:09:16,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 13:09:16,498 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 13:09:16,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 13:09:16,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-06 13:09:16,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 13:09:16,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 13:09:16,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:16,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 13:09:16,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 13:09:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:16,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 13:09:16,797 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-02-06 13:09:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 13:09:16,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335614771] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 13:09:16,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 13:09:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-02-06 13:09:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526686539] [2025-02-06 13:09:16,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 13:09:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 13:09:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:16,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 13:09:16,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-02-06 13:09:17,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2025-02-06 13:09:17,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 52 transitions, 281 flow. Second operand has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 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-02-06 13:09:17,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:17,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2025-02-06 13:09:17,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,178 INFO L124 PetriNetUnfolderBase]: 2438/3531 cut-off events. [2025-02-06 13:09:18,179 INFO L125 PetriNetUnfolderBase]: For 6330/6474 co-relation queries the response was YES. [2025-02-06 13:09:18,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11398 conditions, 3531 events. 2438/3531 cut-off events. For 6330/6474 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16583 event pairs, 348 based on Foata normal form. 134/3653 useless extension candidates. Maximal degree in co-relation 8325. Up to 672 conditions per place. [2025-02-06 13:09:18,193 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 140 selfloop transitions, 18 changer transitions 0/163 dead transitions. [2025-02-06 13:09:18,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 163 transitions, 1109 flow [2025-02-06 13:09:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 13:09:18,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 13:09:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2025-02-06 13:09:18,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2025-02-06 13:09:18,195 INFO L175 Difference]: Start difference. First operand has 72 places, 52 transitions, 281 flow. Second operand 14 states and 290 transitions. [2025-02-06 13:09:18,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 163 transitions, 1109 flow [2025-02-06 13:09:18,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 163 transitions, 902 flow, removed 43 selfloop flow, removed 11 redundant places. [2025-02-06 13:09:18,200 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 283 flow [2025-02-06 13:09:18,200 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-02-06 13:09:18,203 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2025-02-06 13:09:18,203 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 283 flow [2025-02-06 13:09:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.380952380952381) internal successors, (281), 21 states have internal predecessors, (281), 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-02-06 13:09:18,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,203 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-02-06 13:09:18,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 13:09:18,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 13:09:18,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:18,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1235741713, now seen corresponding path program 1 times [2025-02-06 13:09:18,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747628506] [2025-02-06 13:09:18,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 13:09:18,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 13:09:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747628506] [2025-02-06 13:09:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747628506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407477569] [2025-02-06 13:09:18,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:18,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:18,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-06 13:09:18,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-06 13:09:18,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:18,771 INFO L124 PetriNetUnfolderBase]: 1769/2825 cut-off events. [2025-02-06 13:09:18,771 INFO L125 PetriNetUnfolderBase]: For 4468/4529 co-relation queries the response was YES. [2025-02-06 13:09:18,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 2825 events. 1769/2825 cut-off events. For 4468/4529 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 14350 event pairs, 803 based on Foata normal form. 108/2919 useless extension candidates. Maximal degree in co-relation 6617. Up to 1863 conditions per place. [2025-02-06 13:09:18,788 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 59 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2025-02-06 13:09:18,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 519 flow [2025-02-06 13:09:18,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-02-06 13:09:18,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48 [2025-02-06 13:09:18,789 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 283 flow. Second operand 4 states and 96 transitions. [2025-02-06 13:09:18,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 519 flow [2025-02-06 13:09:18,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 421 flow, removed 18 selfloop flow, removed 11 redundant places. [2025-02-06 13:09:18,796 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 230 flow [2025-02-06 13:09:18,797 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-02-06 13:09:18,797 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2025-02-06 13:09:18,797 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 230 flow [2025-02-06 13:09:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:18,798 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-02-06 13:09:18,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 13:09:18,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:18,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:18,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1294465275, now seen corresponding path program 1 times [2025-02-06 13:09:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:18,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032299597] [2025-02-06 13:09:18,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 13:09:18,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 13:09:18,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:18,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032299597] [2025-02-06 13:09:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032299597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 13:09:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946502333] [2025-02-06 13:09:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 13:09:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:18,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 13:09:18,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 13:09:18,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-06 13:09:18,862 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.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:18,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:18,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-06 13:09:18,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:19,051 INFO L124 PetriNetUnfolderBase]: 1659/2668 cut-off events. [2025-02-06 13:09:19,051 INFO L125 PetriNetUnfolderBase]: For 2401/2496 co-relation queries the response was YES. [2025-02-06 13:09:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 2668 events. 1659/2668 cut-off events. For 2401/2496 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 13917 event pairs, 881 based on Foata normal form. 110/2765 useless extension candidates. Maximal degree in co-relation 5561. Up to 1769 conditions per place. [2025-02-06 13:09:19,065 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 54 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2025-02-06 13:09:19,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 411 flow [2025-02-06 13:09:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 13:09:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 13:09:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-02-06 13:09:19,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.475 [2025-02-06 13:09:19,067 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 230 flow. Second operand 4 states and 95 transitions. [2025-02-06 13:09:19,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 411 flow [2025-02-06 13:09:19,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 391 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:19,071 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 221 flow [2025-02-06 13:09:19,072 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-02-06 13:09:19,073 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2025-02-06 13:09:19,073 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 221 flow [2025-02-06 13:09:19,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 13:09:19,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 13:09:19,073 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-02-06 13:09:19,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 13:09:19,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-02-06 13:09:19,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 13:09:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 507019466, now seen corresponding path program 1 times [2025-02-06 13:09:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 13:09:19,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612816066] [2025-02-06 13:09:19,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 13:09:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 13:09:19,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 13:09:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 13:09:19,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 13:09:19,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 13:09:19,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 13:09:19,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 13:09:19,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612816066] [2025-02-06 13:09:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612816066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 13:09:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 13:09:19,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 13:09:19,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586591483] [2025-02-06 13:09:19,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 13:09:19,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 13:09:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 13:09:19,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 13:09:19,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 13:09:19,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-02-06 13:09:19,300 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-02-06 13:09:19,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 13:09:19,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-02-06 13:09:19,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 13:09:19,508 INFO L124 PetriNetUnfolderBase]: 1659/2570 cut-off events. [2025-02-06 13:09:19,508 INFO L125 PetriNetUnfolderBase]: For 2393/2483 co-relation queries the response was YES. [2025-02-06 13:09:19,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7053 conditions, 2570 events. 1659/2570 cut-off events. For 2393/2483 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12416 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-02-06 13:09:19,515 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 0 selfloop transitions, 0 changer transitions 116/116 dead transitions. [2025-02-06 13:09:19,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 116 transitions, 712 flow [2025-02-06 13:09:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 13:09:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 13:09:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 207 transitions. [2025-02-06 13:09:19,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.414 [2025-02-06 13:09:19,518 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 221 flow. Second operand 10 states and 207 transitions. [2025-02-06 13:09:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 116 transitions, 712 flow [2025-02-06 13:09:19,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 116 transitions, 676 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 13:09:19,521 INFO L231 Difference]: Finished difference. Result has 71 places, 0 transitions, 0 flow [2025-02-06 13:09:19,521 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-02-06 13:09:19,522 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2025-02-06 13:09:19,523 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 0 transitions, 0 flow [2025-02-06 13:09:19,523 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-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-02-06 13:09:19,525 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (12 of 27 remaining) [2025-02-06 13:09:19,526 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (11 of 27 remaining) [2025-02-06 13:09:19,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 27 remaining) [2025-02-06 13:09:19,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 27 remaining) [2025-02-06 13:09:19,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 27 remaining) [2025-02-06 13:09:19,527 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-02-06 13:09:19,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-02-06 13:09:19,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 13:09:19,529 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 13:09:19,533 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 13:09:19,533 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 13:09:19,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:09:19 BasicIcfg [2025-02-06 13:09:19,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 13:09:19,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 13:09:19,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 13:09:19,539 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 13:09:19,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:08" (3/4) ... [2025-02-06 13:09:19,540 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 13:09:19,542 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 13:09:19,543 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 13:09:19,543 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 13:09:19,546 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2025-02-06 13:09:19,547 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-02-06 13:09:19,547 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 13:09:19,548 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 13:09:19,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 13:09:19,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 13:09:19,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 13:09:19,611 INFO L158 Benchmark]: Toolchain (without parser) took 12346.13ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 112.9MB in the beginning and 259.2MB in the end (delta: -146.3MB). Peak memory consumption was 162.1MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,612 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:09:19,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.09ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.92ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 13:09:19,613 INFO L158 Benchmark]: Boogie Preprocessor took 38.70ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,613 INFO L158 Benchmark]: IcfgBuilder took 449.61ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 58.3MB in the end (delta: 39.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,613 INFO L158 Benchmark]: TraceAbstraction took 11482.70ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 57.8MB in the beginning and 267.6MB in the end (delta: -209.8MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,614 INFO L158 Benchmark]: Witness Printer took 71.71ms. Allocated memory is still 453.0MB. Free memory was 267.6MB in the beginning and 259.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 13:09:19,615 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.14ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.09ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.92ms. Allocated memory is still 142.6MB. Free memory was 100.9MB in the beginning and 99.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.70ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 449.61ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 58.3MB in the end (delta: 39.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11482.70ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 57.8MB in the beginning and 267.6MB in the end (delta: -209.8MB). Peak memory consumption was 103.4MB. Max. memory is 16.1GB. * Witness Printer took 71.71ms. Allocated memory is still 453.0MB. Free memory was 267.6MB in the beginning and 259.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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: 11.4s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1184 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1071 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 494 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5836 IncrementalHoareTripleChecker+Invalid, 5867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 13 mSDtfsCounter, 5836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.4s 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.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 318 ConstructedInterpolants, 1 QuantifiedInterpolants, 2592 SizeOfPredicates, 23 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 122/181 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-02-06 13:09:19,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE