./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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-array-sum-alt2.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 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:40:13,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:40:13,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:40:13,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:40:13,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:40:13,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:40:13,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:40:13,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:40:13,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:40:13,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:40:13,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:40:13,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:40:13,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:40:13,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:40:13,393 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:40:13,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:40:13,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:40:13,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:40:13,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:40:13,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:40:13,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:13,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:40:13,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:40:13,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:40:13,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:40:13,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:40:13,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:40:13,396 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 -> 1d936eafcc314e66bb4cd572754c58bf1f2fc59d35c83764f43dae769bce220a [2025-02-08 08:40:13,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:40:13,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:40:13,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:40:13,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:40:13,646 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:40:13,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-02-08 08:40:14,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6e10bc2/361590e965d449c6a79339e5ddbcdaf6/FLAGb0b72d156 [2025-02-08 08:40:15,078 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:40:15,083 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2025-02-08 08:40:15,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6e10bc2/361590e965d449c6a79339e5ddbcdaf6/FLAGb0b72d156 [2025-02-08 08:40:15,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6e10bc2/361590e965d449c6a79339e5ddbcdaf6 [2025-02-08 08:40:15,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:40:15,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:40:15,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:15,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:40:15,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:40:15,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15, skipping insertion in model container [2025-02-08 08:40:15,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:40:15,548 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-08 08:40:15,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:15,563 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:40:15,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:40:15,598 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:40:15,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15 WrapperNode [2025-02-08 08:40:15,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:40:15,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:15,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:40:15,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:40:15,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,628 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 172 [2025-02-08 08:40:15,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:40:15,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:40:15,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:40:15,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:40:15,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,653 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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-08 08:40:15,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:40:15,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:40:15,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:40:15,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:40:15,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (1/1) ... [2025-02-08 08:40:15,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:40:15,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:15,687 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-08 08:40:15,692 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-08 08:40:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:40:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:40:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:40:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:40:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:40:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:40:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:40:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:40:15,706 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:40:15,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:40:15,795 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:40:15,879 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~ret2#1; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-1: havoc #t~mem1#1; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-2: ~res1~0 := #t~ret2#1; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~post3#1; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: ~i~0#1 := 1 + #t~post3#1; [2025-02-08 08:40:15,881 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:15,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: #t~post3#1 := ~i~0#1; [2025-02-08 08:40:15,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:15,882 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49-6: #t~ret2#1 := plus_#res#1; [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~ret5#1; [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-1: havoc #t~mem4#1; [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-2: ~res2~0 := #t~ret5#1; [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: havoc #t~post6#1; [2025-02-08 08:40:15,936 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret5#1 && #t~ret5#1 <= 2147483647; [2025-02-08 08:40:15,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-2: ~i~1#1 := 1 + #t~post6#1; [2025-02-08 08:40:15,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:15,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-3: #t~post6#1 := ~i~1#1; [2025-02-08 08:40:15,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:15,937 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L59-6: #t~ret5#1 := plus_#res#1; [2025-02-08 08:40:15,981 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: havoc #t~ret8#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-1: havoc #t~mem7#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-2: ~res2~0 := #t~ret8#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-1: havoc #t~post9#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-2: ~i~2#1 := 1 + #t~post9#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-3: #t~post9#1 := ~i~2#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-6: #t~ret8#1 := plus_#res#1; [2025-02-08 08:40:15,982 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: [2025-02-08 08:40:16,063 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:40:16,063 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:40:16,244 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 08:40:16,245 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 08:40:16,245 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L114 is not an error location. [2025-02-08 08:40:16,245 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:40:16,246 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:40:16,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:16 BoogieIcfgContainer [2025-02-08 08:40:16,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:40:16,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:40:16,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:40:16,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:40:16,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:40:15" (1/3) ... [2025-02-08 08:40:16,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482e4a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:16, skipping insertion in model container [2025-02-08 08:40:16,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:40:15" (2/3) ... [2025-02-08 08:40:16,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482e4a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:40:16, skipping insertion in model container [2025-02-08 08:40:16,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:16" (3/3) ... [2025-02-08 08:40:16,254 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-02-08 08:40:16,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:40:16,264 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 41 locations, 1 initial locations, 4 loop locations, and 10 error locations. [2025-02-08 08:40:16,265 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:40:16,319 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:40:16,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 103 flow [2025-02-08 08:40:16,361 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2025-02-08 08:40:16,364 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:40:16,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 38 events. 1/38 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-02-08 08:40:16,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 103 flow [2025-02-08 08:40:16,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 92 flow [2025-02-08 08:40:16,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:40:16,387 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;@5c6be59b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:40:16,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-08 08:40:16,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:40:16,390 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:40:16,390 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:40:16,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:16,391 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:16,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash 489477, now seen corresponding path program 1 times [2025-02-08 08:40:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143711093] [2025-02-08 08:40:16,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:16,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:16,576 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-08 08:40:16,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:16,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143711093] [2025-02-08 08:40:16,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143711093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:16,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:16,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:40:16,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762645414] [2025-02-08 08:40:16,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:16,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:16,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:16,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:16,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:16,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 08:40:16,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:16,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:16,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:16,850 INFO L124 PetriNetUnfolderBase]: 1061/1675 cut-off events. [2025-02-08 08:40:16,850 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-08 08:40:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1675 events. 1061/1675 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9555 event pairs, 1060 based on Foata normal form. 1/1122 useless extension candidates. Maximal degree in co-relation 3153. Up to 1622 conditions per place. [2025-02-08 08:40:16,859 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 27 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2025-02-08 08:40:16,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 144 flow [2025-02-08 08:40:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-02-08 08:40:16,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4715447154471545 [2025-02-08 08:40:16,869 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 92 flow. Second operand 3 states and 58 transitions. [2025-02-08 08:40:16,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 144 flow [2025-02-08 08:40:16,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 132 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:40:16,874 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 78 flow [2025-02-08 08:40:16,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-02-08 08:40:16,881 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2025-02-08 08:40:16,881 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 78 flow [2025-02-08 08:40:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-08 08:40:16,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:16,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:40:16,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:40:16,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 489478, now seen corresponding path program 1 times [2025-02-08 08:40:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:16,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870617370] [2025-02-08 08:40:16,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:16,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:40:16,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:40:16,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:16,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:17,125 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-08 08:40:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:17,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870617370] [2025-02-08 08:40:17,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870617370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:17,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:17,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:17,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110293548] [2025-02-08 08:40:17,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:17,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:17,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:17,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:17,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:17,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:17,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-08 08:40:17,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:17,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:17,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:17,322 INFO L124 PetriNetUnfolderBase]: 1062/1678 cut-off events. [2025-02-08 08:40:17,322 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:40:17,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 1678 events. 1062/1678 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9575 event pairs, 1060 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 3333. Up to 1627 conditions per place. [2025-02-08 08:40:17,334 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-02-08 08:40:17,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 152 flow [2025-02-08 08:40:17,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-08 08:40:17,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2025-02-08 08:40:17,336 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 78 flow. Second operand 4 states and 70 transitions. [2025-02-08 08:40:17,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 152 flow [2025-02-08 08:40:17,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:17,339 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 101 flow [2025-02-08 08:40:17,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-02-08 08:40:17,339 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-02-08 08:40:17,340 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 101 flow [2025-02-08 08:40:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-08 08:40:17,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:17,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:40:17,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:40:17,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 470404063, now seen corresponding path program 1 times [2025-02-08 08:40:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:17,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-02-08 08:40:17,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:17,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:17,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:17,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:17,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:17,607 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-08 08:40:17,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029213427] [2025-02-08 08:40:17,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029213427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:17,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896610238] [2025-02-08 08:40:17,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:17,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:17,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:17,611 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-08 08:40:17,612 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-08 08:40:17,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:40:17,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:40:17,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:17,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:17,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:17,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:17,712 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-08 08:40:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:17,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:17,997 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-08 08:40:17,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896610238] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:17,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:17,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:40:17,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936812987] [2025-02-08 08:40:17,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:17,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:17,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:18,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:18,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-08 08:40:18,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:18,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:18,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:18,370 INFO L124 PetriNetUnfolderBase]: 1062/1677 cut-off events. [2025-02-08 08:40:18,370 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:40:18,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1677 events. 1062/1677 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 9582 event pairs, 1060 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 3340. Up to 1623 conditions per place. [2025-02-08 08:40:18,376 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 25 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2025-02-08 08:40:18,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 36 transitions, 161 flow [2025-02-08 08:40:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-02-08 08:40:18,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35365853658536583 [2025-02-08 08:40:18,378 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 101 flow. Second operand 6 states and 87 transitions. [2025-02-08 08:40:18,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 36 transitions, 161 flow [2025-02-08 08:40:18,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:40:18,379 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 108 flow [2025-02-08 08:40:18,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-02-08 08:40:18,380 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2025-02-08 08:40:18,380 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 108 flow [2025-02-08 08:40:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 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-08 08:40:18,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:18,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:40:18,386 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-08 08:40:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:18,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:18,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1699721101, now seen corresponding path program 1 times [2025-02-08 08:40:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605671552] [2025-02-08 08:40:18,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:18,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:18,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:18,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:18,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,639 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-08 08:40:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605671552] [2025-02-08 08:40:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605671552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:18,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713906608] [2025-02-08 08:40:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:18,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:40:18,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:18,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:40:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:40:18,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:18,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-08 08:40:18,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:18,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:18,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:18,756 INFO L124 PetriNetUnfolderBase]: 610/994 cut-off events. [2025-02-08 08:40:18,757 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:40:18,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 994 events. 610/994 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5104 event pairs, 608 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1976. Up to 952 conditions per place. [2025-02-08 08:40:18,760 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 26 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-02-08 08:40:18,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 160 flow [2025-02-08 08:40:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:40:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:40:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-02-08 08:40:18,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2025-02-08 08:40:18,763 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 108 flow. Second operand 4 states and 65 transitions. [2025-02-08 08:40:18,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 160 flow [2025-02-08 08:40:18,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 130 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-08 08:40:18,764 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 78 flow [2025-02-08 08:40:18,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-02-08 08:40:18,765 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2025-02-08 08:40:18,765 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 78 flow [2025-02-08 08:40:18,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-08 08:40:18,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:18,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:40:18,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:40:18,765 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1699721102, now seen corresponding path program 1 times [2025-02-08 08:40:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-02-08 08:40:18,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:18,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:40:18,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:40:18,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:18,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:18,845 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-08 08:40:18,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:18,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379437405] [2025-02-08 08:40:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379437405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:18,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:40:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392781202] [2025-02-08 08:40:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:18,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:18,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:18,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:18,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:18,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:18,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:18,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:18,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:18,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:19,054 INFO L124 PetriNetUnfolderBase]: 1092/1778 cut-off events. [2025-02-08 08:40:19,054 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 08:40:19,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3560 conditions, 1778 events. 1092/1778 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 9743 event pairs, 908 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 2354. Up to 1142 conditions per place. [2025-02-08 08:40:19,062 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 58 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-02-08 08:40:19,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 66 transitions, 278 flow [2025-02-08 08:40:19,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-02-08 08:40:19,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5317073170731708 [2025-02-08 08:40:19,065 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 78 flow. Second operand 5 states and 109 transitions. [2025-02-08 08:40:19,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 66 transitions, 278 flow [2025-02-08 08:40:19,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:19,067 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 99 flow [2025-02-08 08:40:19,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-02-08 08:40:19,069 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2025-02-08 08:40:19,069 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 99 flow [2025-02-08 08:40:19,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:19,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:19,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:19,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:40:19,069 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:19,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:19,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1319101445, now seen corresponding path program 1 times [2025-02-08 08:40:19,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:19,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-02-08 08:40:19,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:19,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:19,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:19,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:19,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:19,146 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-08 08:40:19,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:19,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576321089] [2025-02-08 08:40:19,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576321089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:19,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:19,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:40:19,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801544583] [2025-02-08 08:40:19,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:19,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:19,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:19,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:19,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:19,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 08:40:19,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:19,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:19,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:19,312 INFO L124 PetriNetUnfolderBase]: 943/1521 cut-off events. [2025-02-08 08:40:19,313 INFO L125 PetriNetUnfolderBase]: For 390/462 co-relation queries the response was YES. [2025-02-08 08:40:19,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3373 conditions, 1521 events. 943/1521 cut-off events. For 390/462 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 7844 event pairs, 848 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 2508. Up to 1152 conditions per place. [2025-02-08 08:40:19,321 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 2/61 dead transitions. [2025-02-08 08:40:19,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 283 flow [2025-02-08 08:40:19,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-02-08 08:40:19,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5073170731707317 [2025-02-08 08:40:19,323 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 99 flow. Second operand 5 states and 104 transitions. [2025-02-08 08:40:19,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 283 flow [2025-02-08 08:40:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:19,325 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 119 flow [2025-02-08 08:40:19,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2025-02-08 08:40:19,325 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2025-02-08 08:40:19,325 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 119 flow [2025-02-08 08:40:19,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-08 08:40:19,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:19,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:40:19,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -668262123, now seen corresponding path program 1 times [2025-02-08 08:40:19,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43343860] [2025-02-08 08:40:19,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:19,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:19,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:19,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:19,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43343860] [2025-02-08 08:40:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43343860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:19,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139903192] [2025-02-08 08:40:19,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:19,466 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-08 08:40:19,467 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-08 08:40:19,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:40:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:40:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:19,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 08:40:19,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:19,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:19,618 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-08 08:40:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:19,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139903192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:40:19,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:40:19,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:40:19,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-02-08 08:40:19,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:40:19,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:40:19,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:19,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:40:19,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:40:19,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-02-08 08:40:19,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 119 flow. Second operand has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:19,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:19,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-02-08 08:40:19,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:19,881 INFO L124 PetriNetUnfolderBase]: 686/1157 cut-off events. [2025-02-08 08:40:19,881 INFO L125 PetriNetUnfolderBase]: For 662/746 co-relation queries the response was YES. [2025-02-08 08:40:19,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 1157 events. 686/1157 cut-off events. For 662/746 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5962 event pairs, 421 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 1855. Up to 390 conditions per place. [2025-02-08 08:40:19,885 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2025-02-08 08:40:19,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 63 transitions, 301 flow [2025-02-08 08:40:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2025-02-08 08:40:19,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2025-02-08 08:40:19,887 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 119 flow. Second operand 6 states and 120 transitions. [2025-02-08 08:40:19,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 63 transitions, 301 flow [2025-02-08 08:40:19,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:19,889 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 124 flow [2025-02-08 08:40:19,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-02-08 08:40:19,889 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-02-08 08:40:19,889 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 124 flow [2025-02-08 08:40:19,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.454545454545455) internal successors, (126), 11 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:40:19,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:19,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:19,896 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-08 08:40:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:20,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2019889100, now seen corresponding path program 1 times [2025-02-08 08:40:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:20,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-02-08 08:40:20,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:20,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:20,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:20,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86321855] [2025-02-08 08:40:20,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86321855] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:20,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377232000] [2025-02-08 08:40:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:20,210 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-08 08:40:20,211 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-08 08:40:20,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:20,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:20,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:40:20,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:20,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:40:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:20,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:40:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:20,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377232000] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:40:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-02-08 08:40:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678167550] [2025-02-08 08:40:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:20,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:40:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:20,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:40:20,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:20,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-02-08 08:40:20,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08 08:40:20,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:20,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-02-08 08:40:20,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:20,631 INFO L124 PetriNetUnfolderBase]: 581/1023 cut-off events. [2025-02-08 08:40:20,631 INFO L125 PetriNetUnfolderBase]: For 910/958 co-relation queries the response was YES. [2025-02-08 08:40:20,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 1023 events. 581/1023 cut-off events. For 910/958 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5377 event pairs, 370 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1654. Up to 340 conditions per place. [2025-02-08 08:40:20,636 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 47 selfloop transitions, 6 changer transitions 3/60 dead transitions. [2025-02-08 08:40:20,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 300 flow [2025-02-08 08:40:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:20,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-02-08 08:40:20,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47560975609756095 [2025-02-08 08:40:20,638 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 124 flow. Second operand 6 states and 117 transitions. [2025-02-08 08:40:20,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 300 flow [2025-02-08 08:40:20,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 286 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:20,640 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 120 flow [2025-02-08 08:40:20,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2025-02-08 08:40:20,640 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-02-08 08:40:20,640 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 120 flow [2025-02-08 08:40:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-08 08:40:20,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:20,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:20,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 08:40:20,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:20,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:20,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 622236485, now seen corresponding path program 1 times [2025-02-08 08:40:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:20,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40495972] [2025-02-08 08:40:20,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:20,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:20,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:40:20,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:40:20,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40495972] [2025-02-08 08:40:20,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40495972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:20,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:20,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:40:20,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215496738] [2025-02-08 08:40:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:40:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:20,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:40:20,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:40:20,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:20,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-08 08:40:20,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:20,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:20,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,042 INFO L124 PetriNetUnfolderBase]: 503/839 cut-off events. [2025-02-08 08:40:21,042 INFO L125 PetriNetUnfolderBase]: For 924/1013 co-relation queries the response was YES. [2025-02-08 08:40:21,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 839 events. 503/839 cut-off events. For 924/1013 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3760 event pairs, 463 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 1612. Up to 610 conditions per place. [2025-02-08 08:40:21,045 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-02-08 08:40:21,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 280 flow [2025-02-08 08:40:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:40:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:40:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2025-02-08 08:40:21,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4682926829268293 [2025-02-08 08:40:21,046 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 120 flow. Second operand 5 states and 96 transitions. [2025-02-08 08:40:21,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 280 flow [2025-02-08 08:40:21,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 266 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:21,048 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 133 flow [2025-02-08 08:40:21,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2025-02-08 08:40:21,048 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2025-02-08 08:40:21,048 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 133 flow [2025-02-08 08:40:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-08 08:40:21,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:21,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:40:21,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash -230692532, now seen corresponding path program 1 times [2025-02-08 08:40:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-02-08 08:40:21,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:21,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:21,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:21,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:21,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001300950] [2025-02-08 08:40:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001300950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:40:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837279440] [2025-02-08 08:40:21,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:40:21,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:40:21,215 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-08 08:40:21,217 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-08 08:40:21,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:40:21,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:40:21,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:21,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:40:21,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:40:21,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:40:21,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:40:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837279440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:40:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-02-08 08:40:21,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964104188] [2025-02-08 08:40:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:21,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:40:21,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:40:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:40:21,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-02-08 08:40:21,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-08 08:40:21,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:21,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-02-08 08:40:21,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,608 INFO L124 PetriNetUnfolderBase]: 431/736 cut-off events. [2025-02-08 08:40:21,609 INFO L125 PetriNetUnfolderBase]: For 729/795 co-relation queries the response was YES. [2025-02-08 08:40:21,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 736 events. 431/736 cut-off events. For 729/795 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3327 event pairs, 247 based on Foata normal form. 37/730 useless extension candidates. Maximal degree in co-relation 1422. Up to 435 conditions per place. [2025-02-08 08:40:21,611 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 33 selfloop transitions, 7 changer transitions 14/57 dead transitions. [2025-02-08 08:40:21,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 323 flow [2025-02-08 08:40:21,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:40:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:40:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-02-08 08:40:21,613 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2025-02-08 08:40:21,613 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 133 flow. Second operand 6 states and 96 transitions. [2025-02-08 08:40:21,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 323 flow [2025-02-08 08:40:21,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:40:21,615 INFO L231 Difference]: Finished difference. Result has 51 places, 32 transitions, 132 flow [2025-02-08 08:40:21,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=51, PETRI_TRANSITIONS=32} [2025-02-08 08:40:21,616 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2025-02-08 08:40:21,616 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 132 flow [2025-02-08 08:40:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-08 08:40:21,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:40:21,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:21,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 08:40:21,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 08:40:21,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-08 08:40:21,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:40:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1028261025, now seen corresponding path program 1 times [2025-02-08 08:40:21,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:40:21,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-02-08 08:40:21,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:40:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:40:21,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:40:21,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:40:21,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:40:21,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:40:21,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:40:21,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:40:21,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-02-08 08:40:21,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737030096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:40:21,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:40:21,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:40:21,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731826657] [2025-02-08 08:40:21,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:40:21,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:40:21,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:40:21,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:40:21,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:40:21,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-02-08 08:40:21,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 08:40:21,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:40:21,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-02-08 08:40:21,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:40:21,915 INFO L124 PetriNetUnfolderBase]: 249/453 cut-off events. [2025-02-08 08:40:21,915 INFO L125 PetriNetUnfolderBase]: For 703/739 co-relation queries the response was YES. [2025-02-08 08:40:21,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 453 events. 249/453 cut-off events. For 703/739 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1719 event pairs, 248 based on Foata normal form. 2/455 useless extension candidates. Maximal degree in co-relation 817. Up to 437 conditions per place. [2025-02-08 08:40:21,917 INFO L140 encePairwiseOnDemand]: 39/41 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2025-02-08 08:40:21,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 30 transitions, 184 flow [2025-02-08 08:40:21,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:40:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:40:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-02-08 08:40:21,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4065040650406504 [2025-02-08 08:40:21,918 INFO L175 Difference]: Start difference. First operand has 51 places, 32 transitions, 132 flow. Second operand 3 states and 50 transitions. [2025-02-08 08:40:21,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 30 transitions, 184 flow [2025-02-08 08:40:21,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 30 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:40:21,919 INFO L231 Difference]: Finished difference. Result has 43 places, 0 transitions, 0 flow [2025-02-08 08:40:21,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=43, PETRI_TRANSITIONS=0} [2025-02-08 08:40:21,920 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2025-02-08 08:40:21,920 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 0 transitions, 0 flow [2025-02-08 08:40:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 08:40:21,921 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (10 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2025-02-08 08:40:21,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 19 remaining) [2025-02-08 08:40:21,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:40:21,922 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:40:21,926 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:40:21,926 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:40:21,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:40:21 BasicIcfg [2025-02-08 08:40:21,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:40:21,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:40:21,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:40:21,930 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:40:21,930 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:40:16" (3/4) ... [2025-02-08 08:40:21,931 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:40:21,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:40:21,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:40:21,933 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:40:21,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-02-08 08:40:21,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-02-08 08:40:21,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:40:21,936 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 08:40:21,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:40:21,998 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:40:21,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:40:21,999 INFO L158 Benchmark]: Toolchain (without parser) took 6589.86ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.2MB in the beginning and 75.7MB in the end (delta: 37.5MB). Peak memory consumption was 113.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:21,999 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.39ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: Boogie Preprocessor took 34.36ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: IcfgBuilder took 581.62ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 46.4MB in the end (delta: 50.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: TraceAbstraction took 5682.07ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 45.9MB in the beginning and 81.8MB in the end (delta: -35.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-08 08:40:22,000 INFO L158 Benchmark]: Witness Printer took 68.42ms. Allocated memory is still 218.1MB. Free memory was 81.8MB in the beginning and 75.7MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:40:22,001 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.39ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 101.0MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.36ms. Allocated memory is still 142.6MB. Free memory was 99.5MB in the beginning and 97.2MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 581.62ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 46.4MB in the end (delta: 50.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5682.07ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 45.9MB in the beginning and 81.8MB in the end (delta: -35.9MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 68.42ms. Allocated memory is still 218.1MB. Free memory was 81.8MB in the beginning and 75.7MB in the end (delta: 6.1MB). 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: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 76]: 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, 65 locations, 19 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: 5.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 343 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 13 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=9, InterpolantAutomatonStates: 53, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 130 ConstructedInterpolants, 1 QuantifiedInterpolants, 1463 SizeOfPredicates, 14 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 39/56 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:40:22,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE