./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.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/chl-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:33:58,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:33:58,638 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:33:58,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:33:58,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:33:58,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:33:58,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:33:58,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:33:58,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:33:58,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:33:58,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:33:58,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:33:58,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:33:58,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:33:58,660 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:33:58,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:33:58,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:33:58,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:33:58,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:33:58,662 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-02-08 08:33:58,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:33:58,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:33:58,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:33:58,907 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:33:58,907 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:33:58,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-08 08:34:00,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f4b22496/e1e5977aac794146a464c14067f702b6/FLAGb5e66a697 [2025-02-08 08:34:00,317 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:34:00,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-02-08 08:34:00,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f4b22496/e1e5977aac794146a464c14067f702b6/FLAGb5e66a697 [2025-02-08 08:34:00,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f4b22496/e1e5977aac794146a464c14067f702b6 [2025-02-08 08:34:00,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:34:00,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:34:00,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:34:00,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:34:00,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:34:00,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00, skipping insertion in model container [2025-02-08 08:34:00,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:34:00,781 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:34:00,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:34:00,792 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:34:00,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:34:00,829 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:34:00,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00 WrapperNode [2025-02-08 08:34:00,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:34:00,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:34:00,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:34:00,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:34:00,836 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:34:00" (1/1) ... [2025-02-08 08:34:00,841 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:34:00" (1/1) ... [2025-02-08 08:34:00,862 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 255 [2025-02-08 08:34:00,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:34:00,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:34:00,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:34:00,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:34:00,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,892 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-02-08 08:34:00,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,905 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:34:00,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:34:00,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:34:00,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:34:00,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (1/1) ... [2025-02-08 08:34:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:34:00,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:00,947 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:34:00,955 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:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:34:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:34:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:34:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:34:00,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:34:00,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:34:00,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:34:00,969 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:34:01,041 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:34:01,042 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:34:01,143 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~post4#1; [2025-02-08 08:34:01,144 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: #t~post4#1 := ~i~0#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: havoc #t~ret3#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-1: havoc #t~mem2#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~mem1#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: ~result_7~0 := #t~ret3#1; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 08:34:01,145 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:34:01,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:34:01,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-7: #t~ret3#1 := minus_#res#1; [2025-02-08 08:34:01,146 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: ~stop~0#1 := (if 0 == (if 0 != ~result_7~0 then 1 else 0) then 0 else 1); [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: ~result_10~0 := #t~ret7#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: #t~ret7#1 := minus_#res#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69: ~stop~1#1 := (if 0 == (if 0 != ~result_10~0 then 1 else 0) then 0 else 1); [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~post8#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: ~i~1#1 := 1 + #t~post8#1; [2025-02-08 08:34:01,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: #t~post8#1 := ~i~1#1; [2025-02-08 08:34:01,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68: havoc #t~ret7#1; [2025-02-08 08:34:01,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-1: havoc #t~mem6#1; [2025-02-08 08:34:01,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~mem5#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82: havoc #t~ret11#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-1: havoc #t~mem10#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-2: havoc #t~mem9#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-3: ~result_13~0 := #t~ret11#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-4: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret11#1 && #t~ret11#1 <= 2147483647; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-5: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-6: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L82-7: #t~ret11#1 := minus_#res#1; [2025-02-08 08:34:01,271 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: ~stop~2#1 := (if 0 == (if 0 != ~result_13~0 then 1 else 0) then 0 else 1); [2025-02-08 08:34:01,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84: havoc #t~post12#1; [2025-02-08 08:34:01,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-1: ~i~2#1 := 1 + #t~post12#1; [2025-02-08 08:34:01,272 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L84-2: #t~post12#1 := ~i~2#1; [2025-02-08 08:34:01,418 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:34:01,418 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:34:01,633 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:34:01,634 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:34:01,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:01 BoogieIcfgContainer [2025-02-08 08:34:01,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:34:01,635 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:34:01,635 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:34:01,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:34:01,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:34:00" (1/3) ... [2025-02-08 08:34:01,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d18425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:34:01, skipping insertion in model container [2025-02-08 08:34:01,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:34:00" (2/3) ... [2025-02-08 08:34:01,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d18425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:34:01, skipping insertion in model container [2025-02-08 08:34:01,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:01" (3/3) ... [2025-02-08 08:34:01,640 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-02-08 08:34:01,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:34:01,651 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 58 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-02-08 08:34:01,651 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:34:01,695 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:34:01,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 60 transitions, 141 flow [2025-02-08 08:34:01,736 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2025-02-08 08:34:01,737 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:34:01,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 3/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 158 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-08 08:34:01,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 60 transitions, 141 flow [2025-02-08 08:34:01,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 56 transitions, 130 flow [2025-02-08 08:34:01,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:34:01,756 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;@9121ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:34:01,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 08:34:01,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:34:01,759 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:34:01,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:34:01,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:01,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:34:01,759 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:01,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash 740314, now seen corresponding path program 1 times [2025-02-08 08:34:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:01,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67004646] [2025-02-08 08:34:01,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:01,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:34:01,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:34:01,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:01,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:01,993 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:34:01,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:01,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67004646] [2025-02-08 08:34:01,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67004646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:34:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089259931] [2025-02-08 08:34:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:34:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:02,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:34:02,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:34:02,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 08:34:02,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:02,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:02,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 08:34:02,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:02,242 INFO L124 PetriNetUnfolderBase]: 309/666 cut-off events. [2025-02-08 08:34:02,242 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-08 08:34:02,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 666 events. 309/666 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3907 event pairs, 306 based on Foata normal form. 1/551 useless extension candidates. Maximal degree in co-relation 1088. Up to 498 conditions per place. [2025-02-08 08:34:02,250 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-02-08 08:34:02,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 178 flow [2025-02-08 08:34:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:34:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:34:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-02-08 08:34:02,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-02-08 08:34:02,262 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 130 flow. Second operand 3 states and 111 transitions. [2025-02-08 08:34:02,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 178 flow [2025-02-08 08:34:02,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:34:02,272 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 112 flow [2025-02-08 08:34:02,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-02-08 08:34:02,276 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -9 predicate places. [2025-02-08 08:34:02,277 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 112 flow [2025-02-08 08:34:02,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:02,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:02,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:34:02,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:34:02,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 740315, now seen corresponding path program 1 times [2025-02-08 08:34:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-02-08 08:34:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:02,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:34:02,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:34:02,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:02,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:02,427 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:34:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521371225] [2025-02-08 08:34:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521371225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:34:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780957627] [2025-02-08 08:34:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:02,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:02,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:02,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 08:34:02,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:34:02,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:02,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 08:34:02,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:02,619 INFO L124 PetriNetUnfolderBase]: 309/672 cut-off events. [2025-02-08 08:34:02,620 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:34:02,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 672 events. 309/672 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3892 event pairs, 306 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 1170. Up to 510 conditions per place. [2025-02-08 08:34:02,624 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 32 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-02-08 08:34:02,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 200 flow [2025-02-08 08:34:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:34:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:34:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-02-08 08:34:02,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-02-08 08:34:02,625 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-02-08 08:34:02,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 200 flow [2025-02-08 08:34:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:02,627 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 146 flow [2025-02-08 08:34:02,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-02-08 08:34:02,627 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -8 predicate places. [2025-02-08 08:34:02,628 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 146 flow [2025-02-08 08:34:02,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:34:02,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:02,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:34:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:34:02,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:02,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 711465163, now seen corresponding path program 1 times [2025-02-08 08:34:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-02-08 08:34:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:02,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:34:02,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:34:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:02,864 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:34:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-02-08 08:34:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20817874] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624417001] [2025-02-08 08:34:02,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:02,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:02,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:02,867 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:34:02,869 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:34:02,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:34:02,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:34:02,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:02,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:02,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-08 08:34:02,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:02,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:03,029 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:34:03,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:03,082 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:34:03,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624417001] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:03,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:03,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-08 08:34:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164226242] [2025-02-08 08:34:03,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:03,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:34:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:03,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:34:03,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:34:03,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 08:34:03,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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:34:03,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:03,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 08:34:03,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:03,475 INFO L124 PetriNetUnfolderBase]: 315/696 cut-off events. [2025-02-08 08:34:03,475 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:34:03,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 696 events. 315/696 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3934 event pairs, 306 based on Foata normal form. 3/583 useless extension candidates. Maximal degree in co-relation 1202. Up to 512 conditions per place. [2025-02-08 08:34:03,478 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 41 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2025-02-08 08:34:03,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 358 flow [2025-02-08 08:34:03,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2025-02-08 08:34:03,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-02-08 08:34:03,481 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 146 flow. Second operand 6 states and 230 transitions. [2025-02-08 08:34:03,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 358 flow [2025-02-08 08:34:03,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:34:03,483 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 292 flow [2025-02-08 08:34:03,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2025-02-08 08:34:03,485 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2025-02-08 08:34:03,485 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 292 flow [2025-02-08 08:34:03,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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:34:03,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:03,486 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-02-08 08:34:03,493 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:34:03,686 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:34:03,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:03,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash 427661211, now seen corresponding path program 2 times [2025-02-08 08:34:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325288467] [2025-02-08 08:34:03,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:03,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:34:03,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:34:03,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:34:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:34:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325288467] [2025-02-08 08:34:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325288467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527504252] [2025-02-08 08:34:03,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:03,954 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:34:03,955 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:34:03,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-08 08:34:04,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:34:04,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:34:04,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:04,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 08:34:04,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:04,021 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:34:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:34:04,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:34:04,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527504252] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:04,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:04,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-02-08 08:34:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588050532] [2025-02-08 08:34:04,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:34:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:04,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:34:04,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:34:04,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 08:34:04,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 292 flow. Second operand has 17 states, 17 states have (on average 27.88235294117647) internal successors, (474), 17 states have internal predecessors, (474), 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:34:04,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:04,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 08:34:04,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:05,102 INFO L124 PetriNetUnfolderBase]: 318/702 cut-off events. [2025-02-08 08:34:05,102 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-08 08:34:05,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 702 events. 318/702 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3987 event pairs, 306 based on Foata normal form. 6/595 useless extension candidates. Maximal degree in co-relation 1234. Up to 501 conditions per place. [2025-02-08 08:34:05,105 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 34 selfloop transitions, 34 changer transitions 0/87 dead transitions. [2025-02-08 08:34:05,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 464 flow [2025-02-08 08:34:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:34:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:34:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2025-02-08 08:34:05,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2025-02-08 08:34:05,107 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 292 flow. Second operand 9 states and 308 transitions. [2025-02-08 08:34:05,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 464 flow [2025-02-08 08:34:05,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 87 transitions, 378 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-02-08 08:34:05,109 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 304 flow [2025-02-08 08:34:05,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=304, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-02-08 08:34:05,109 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-02-08 08:34:05,109 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 304 flow [2025-02-08 08:34:05,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 27.88235294117647) internal successors, (474), 17 states have internal predecessors, (474), 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:34:05,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:05,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:05,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:34:05,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:05,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 596597432, now seen corresponding path program 1 times [2025-02-08 08:34:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806610507] [2025-02-08 08:34:05,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:05,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:05,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:34:05,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:34:05,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:05,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:34:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:05,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806610507] [2025-02-08 08:34:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806610507] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754986895] [2025-02-08 08:34:05,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:05,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:05,401 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:34:05,402 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:34:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:34:05,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:34:05,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:05,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:05,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:34:05,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:34:05,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 08:34:05,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754986895] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:05,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:05,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 08:34:05,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238899713] [2025-02-08 08:34:05,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:05,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:05,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:05,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:05,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:34:05,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-02-08 08:34:05,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 304 flow. Second operand has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:05,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:05,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-02-08 08:34:05,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:05,729 INFO L124 PetriNetUnfolderBase]: 309/693 cut-off events. [2025-02-08 08:34:05,729 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 08:34:05,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 693 events. 309/693 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3904 event pairs, 306 based on Foata normal form. 9/589 useless extension candidates. Maximal degree in co-relation 1170. Up to 504 conditions per place. [2025-02-08 08:34:05,732 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 24 changer transitions 0/78 dead transitions. [2025-02-08 08:34:05,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 416 flow [2025-02-08 08:34:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:34:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:34:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-02-08 08:34:05,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-02-08 08:34:05,733 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 304 flow. Second operand 7 states and 268 transitions. [2025-02-08 08:34:05,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 416 flow [2025-02-08 08:34:05,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 370 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-08 08:34:05,735 INFO L231 Difference]: Finished difference. Result has 63 places, 66 transitions, 252 flow [2025-02-08 08:34:05,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=63, PETRI_TRANSITIONS=66} [2025-02-08 08:34:05,736 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, 0 predicate places. [2025-02-08 08:34:05,736 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 66 transitions, 252 flow [2025-02-08 08:34:05,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.6) internal successors, (316), 10 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:05,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:05,736 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:05,744 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:34:05,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:05,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:05,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash 205864891, now seen corresponding path program 2 times [2025-02-08 08:34:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839886171] [2025-02-08 08:34:05,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:34:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:05,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 08:34:05,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-02-08 08:34:05,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:34:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-08 08:34:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839886171] [2025-02-08 08:34:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839886171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:06,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:34:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489997576] [2025-02-08 08:34:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:06,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:06,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:06,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:06,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-02-08 08:34:06,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 66 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:34:06,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:06,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-02-08 08:34:06,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:06,206 INFO L124 PetriNetUnfolderBase]: 496/980 cut-off events. [2025-02-08 08:34:06,206 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 08:34:06,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 980 events. 496/980 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5359 event pairs, 493 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1753. Up to 780 conditions per place. [2025-02-08 08:34:06,210 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 46 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-02-08 08:34:06,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 346 flow [2025-02-08 08:34:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:34:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:34:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-02-08 08:34:06,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-02-08 08:34:06,211 INFO L175 Difference]: Start difference. First operand has 63 places, 66 transitions, 252 flow. Second operand 5 states and 143 transitions. [2025-02-08 08:34:06,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 346 flow [2025-02-08 08:34:06,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:34:06,213 INFO L231 Difference]: Finished difference. Result has 59 places, 64 transitions, 206 flow [2025-02-08 08:34:06,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=59, PETRI_TRANSITIONS=64} [2025-02-08 08:34:06,213 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-02-08 08:34:06,213 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 64 transitions, 206 flow [2025-02-08 08:34:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:34:06,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:06,214 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:06,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:34:06,214 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:06,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:06,214 INFO L85 PathProgramCache]: Analyzing trace with hash 205864892, now seen corresponding path program 1 times [2025-02-08 08:34:06,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:06,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112978103] [2025-02-08 08:34:06,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:06,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:06,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:34:06,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:34:06,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:06,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-08 08:34:06,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112978103] [2025-02-08 08:34:06,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112978103] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:06,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940754369] [2025-02-08 08:34:06,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:06,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:06,830 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:34:06,831 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:34:06,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 08:34:06,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:34:06,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:06,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:06,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 08:34:06,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:06,932 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:34:06,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:34:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:34:07,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:34:07,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:34:07,044 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:34:07,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 08:34:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:07,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940754369] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 9] total 25 [2025-02-08 08:34:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760191543] [2025-02-08 08:34:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:07,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:34:07,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:34:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2025-02-08 08:34:08,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 08:34:08,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 64 transitions, 206 flow. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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:34:08,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:08,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 08:34:08,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:08,431 INFO L124 PetriNetUnfolderBase]: 389/771 cut-off events. [2025-02-08 08:34:08,432 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:34:08,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 771 events. 389/771 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4053 event pairs, 104 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1375. Up to 537 conditions per place. [2025-02-08 08:34:08,435 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 55 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2025-02-08 08:34:08,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 346 flow [2025-02-08 08:34:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2025-02-08 08:34:08,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 08:34:08,436 INFO L175 Difference]: Start difference. First operand has 59 places, 64 transitions, 206 flow. Second operand 6 states and 204 transitions. [2025-02-08 08:34:08,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 346 flow [2025-02-08 08:34:08,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 341 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:34:08,438 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 207 flow [2025-02-08 08:34:08,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2025-02-08 08:34:08,438 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -3 predicate places. [2025-02-08 08:34:08,439 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 207 flow [2025-02-08 08:34:08,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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:34:08,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:08,439 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:08,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:34:08,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 08:34:08,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:08,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:08,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2086845025, now seen corresponding path program 1 times [2025-02-08 08:34:08,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:08,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408141175] [2025-02-08 08:34:08,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:34:08,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:34:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-08 08:34:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408141175] [2025-02-08 08:34:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408141175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:08,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:08,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:08,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635044128] [2025-02-08 08:34:08,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:34:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:08,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:34:08,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:34:08,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-02-08 08:34:08,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 63 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:34:08,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:08,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-02-08 08:34:08,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:08,939 INFO L124 PetriNetUnfolderBase]: 381/756 cut-off events. [2025-02-08 08:34:08,939 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-02-08 08:34:08,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1525 conditions, 756 events. 381/756 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3965 event pairs, 378 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 1392. Up to 606 conditions per place. [2025-02-08 08:34:08,943 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 45 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-02-08 08:34:08,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 299 flow [2025-02-08 08:34:08,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:34:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:34:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-02-08 08:34:08,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-02-08 08:34:08,943 INFO L175 Difference]: Start difference. First operand has 60 places, 63 transitions, 207 flow. Second operand 5 states and 147 transitions. [2025-02-08 08:34:08,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 299 flow [2025-02-08 08:34:08,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 61 transitions, 292 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:08,945 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 202 flow [2025-02-08 08:34:08,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2025-02-08 08:34:08,945 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -5 predicate places. [2025-02-08 08:34:08,945 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 202 flow [2025-02-08 08:34:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:34:08,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:08,947 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:08,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:34:08,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2086845026, now seen corresponding path program 1 times [2025-02-08 08:34:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:08,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806687746] [2025-02-08 08:34:08,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:08,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:08,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:34:08,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:34:08,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-08 08:34:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806687746] [2025-02-08 08:34:09,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806687746] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:09,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747500672] [2025-02-08 08:34:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:09,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:09,273 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:34:09,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:34:09,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 08:34:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 08:34:09,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:09,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 08:34:09,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:09,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 08:34:09,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:09,490 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:34:09,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 08:34:09,501 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:34:09,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:34:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:09,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747500672] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 14] total 27 [2025-02-08 08:34:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833089318] [2025-02-08 08:34:10,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:10,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:10,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:34:10,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-08 08:34:10,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 202 flow. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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:34:10,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:10,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-08 08:34:10,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:10,477 INFO L124 PetriNetUnfolderBase]: 309/619 cut-off events. [2025-02-08 08:34:10,477 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:34:10,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 619 events. 309/619 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2995 event pairs, 86 based on Foata normal form. 0/590 useless extension candidates. Maximal degree in co-relation 1138. Up to 415 conditions per place. [2025-02-08 08:34:10,479 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-02-08 08:34:10,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 340 flow [2025-02-08 08:34:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2025-02-08 08:34:10,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-02-08 08:34:10,480 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 202 flow. Second operand 6 states and 209 transitions. [2025-02-08 08:34:10,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 340 flow [2025-02-08 08:34:10,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 71 transitions, 335 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:34:10,481 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 203 flow [2025-02-08 08:34:10,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2025-02-08 08:34:10,482 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-02-08 08:34:10,482 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 203 flow [2025-02-08 08:34:10,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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:34:10,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:10,482 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:10,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:34:10,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:10,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash 228785918, now seen corresponding path program 1 times [2025-02-08 08:34:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:10,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782789114] [2025-02-08 08:34:10,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 08:34:10,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:34:10,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-08 08:34:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782789114] [2025-02-08 08:34:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782789114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624494407] [2025-02-08 08:34:11,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:11,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:11,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:11,118 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:34:11,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:34:11,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 08:34:11,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 08:34:11,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:11,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:11,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 08:34:11,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:11,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:34:11,236 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:34:11,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:34:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 08:34:11,377 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:34:11,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:34:11,419 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:34:11,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 08:34:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:11,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624494407] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:12,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 14] total 30 [2025-02-08 08:34:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094576975] [2025-02-08 08:34:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:12,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:34:12,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:12,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:34:12,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2025-02-08 08:34:12,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 08:34:12,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 29.09090909090909) internal successors, (320), 11 states have internal predecessors, (320), 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:34:12,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:12,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 08:34:12,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:12,612 INFO L124 PetriNetUnfolderBase]: 394/820 cut-off events. [2025-02-08 08:34:12,612 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-02-08 08:34:12,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 820 events. 394/820 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4652 event pairs, 48 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1534. Up to 525 conditions per place. [2025-02-08 08:34:12,615 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-02-08 08:34:12,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 342 flow [2025-02-08 08:34:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-02-08 08:34:12,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638888888888889 [2025-02-08 08:34:12,616 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 203 flow. Second operand 6 states and 203 transitions. [2025-02-08 08:34:12,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 342 flow [2025-02-08 08:34:12,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:12,619 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 202 flow [2025-02-08 08:34:12,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2025-02-08 08:34:12,619 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -4 predicate places. [2025-02-08 08:34:12,620 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 202 flow [2025-02-08 08:34:12,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.09090909090909) internal successors, (320), 11 states have internal predecessors, (320), 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:34:12,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:12,621 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:12,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:34:12,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 08:34:12,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:12,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:12,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1497570455, now seen corresponding path program 1 times [2025-02-08 08:34:12,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:12,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914848012] [2025-02-08 08:34:12,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:12,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:34:12,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:34:12,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:12,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:34:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:13,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914848012] [2025-02-08 08:34:13,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914848012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:13,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932459434] [2025-02-08 08:34:13,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:13,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:13,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:34:13,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:34:13,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:34:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:34:13,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:13,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:13,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:34:13,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:13,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:13,304 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:34:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932459434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:34:13,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:34:13,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2025-02-08 08:34:13,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550103354] [2025-02-08 08:34:13,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:34:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:34:13,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:13,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:34:13,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:34:13,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-08 08:34:13,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 202 flow. Second operand has 21 states, 21 states have (on average 30.333333333333332) internal successors, (637), 21 states have internal predecessors, (637), 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:34:13,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:13,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-08 08:34:13,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:14,295 INFO L124 PetriNetUnfolderBase]: 309/693 cut-off events. [2025-02-08 08:34:14,296 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 08:34:14,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 693 events. 309/693 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3920 event pairs, 48 based on Foata normal form. 0/669 useless extension candidates. Maximal degree in co-relation 1298. Up to 396 conditions per place. [2025-02-08 08:34:14,298 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 52 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2025-02-08 08:34:14,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 410 flow [2025-02-08 08:34:14,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:34:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:34:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 316 transitions. [2025-02-08 08:34:14,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851851851851851 [2025-02-08 08:34:14,299 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 202 flow. Second operand 9 states and 316 transitions. [2025-02-08 08:34:14,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 410 flow [2025-02-08 08:34:14,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 403 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:14,301 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 227 flow [2025-02-08 08:34:14,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-02-08 08:34:14,301 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2025-02-08 08:34:14,301 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 227 flow [2025-02-08 08:34:14,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 30.333333333333332) internal successors, (637), 21 states have internal predecessors, (637), 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:34:14,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:14,302 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:14,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:34:14,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:14,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:14,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1497570456, now seen corresponding path program 1 times [2025-02-08 08:34:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958028718] [2025-02-08 08:34:14,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:14,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:14,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:34:14,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:34:14,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-02-08 08:34:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:14,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958028718] [2025-02-08 08:34:14,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958028718] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:14,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:14,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:34:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303261880] [2025-02-08 08:34:14,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:14,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:14,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:14,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 08:34:14,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:34:14,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:14,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 08:34:14,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:14,675 INFO L124 PetriNetUnfolderBase]: 309/621 cut-off events. [2025-02-08 08:34:14,676 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 08:34:14,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 621 events. 309/621 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3063 event pairs, 306 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 1270. Up to 497 conditions per place. [2025-02-08 08:34:14,678 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 44 selfloop transitions, 2 changer transitions 1/56 dead transitions. [2025-02-08 08:34:14,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 56 transitions, 317 flow [2025-02-08 08:34:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:34:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:34:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-02-08 08:34:14,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-02-08 08:34:14,680 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 227 flow. Second operand 4 states and 127 transitions. [2025-02-08 08:34:14,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 56 transitions, 317 flow [2025-02-08 08:34:14,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 284 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 08:34:14,681 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 192 flow [2025-02-08 08:34:14,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-02-08 08:34:14,681 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-02-08 08:34:14,681 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 192 flow [2025-02-08 08:34:14,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:34:14,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:14,681 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:34:14,682 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:14,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 773518589, now seen corresponding path program 1 times [2025-02-08 08:34:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-02-08 08:34:14,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:14,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:14,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 08:34:14,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 08:34:14,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:14,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-02-08 08:34:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-02-08 08:34:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493978939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360167236] [2025-02-08 08:34:14,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:14,966 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:34:14,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:34:15,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 08:34:15,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 08:34:15,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:15,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 08:34:15,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:15,177 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:34:15,258 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 08:34:15,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 08:34:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-08 08:34:15,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360167236] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 14] total 27 [2025-02-08 08:34:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585792226] [2025-02-08 08:34:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:34:16,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 08:34:16,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 192 flow. Second operand has 10 states, 10 states have (on average 29.5) internal successors, (295), 10 states have internal predecessors, (295), 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:34:16,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:16,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 08:34:16,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:16,195 INFO L124 PetriNetUnfolderBase]: 309/631 cut-off events. [2025-02-08 08:34:16,195 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 08:34:16,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 631 events. 309/631 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3129 event pairs, 90 based on Foata normal form. 0/618 useless extension candidates. Maximal degree in co-relation 1280. Up to 329 conditions per place. [2025-02-08 08:34:16,197 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 52 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-02-08 08:34:16,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 326 flow [2025-02-08 08:34:16,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:34:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:34:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-02-08 08:34:16,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-02-08 08:34:16,198 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 192 flow. Second operand 6 states and 201 transitions. [2025-02-08 08:34:16,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 326 flow [2025-02-08 08:34:16,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:34:16,200 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 195 flow [2025-02-08 08:34:16,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2025-02-08 08:34:16,201 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2025-02-08 08:34:16,201 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 195 flow [2025-02-08 08:34:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.5) internal successors, (295), 10 states have internal predecessors, (295), 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:34:16,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:16,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:16,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 08:34:16,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:16,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:16,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1790726829, now seen corresponding path program 1 times [2025-02-08 08:34:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-02-08 08:34:16,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:16,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 08:34:16,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 08:34:16,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:16,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-08 08:34:16,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:16,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-02-08 08:34:16,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072416676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:16,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152207732] [2025-02-08 08:34:16,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:16,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:16,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:34:16,580 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:34:16,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:34:16,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 08:34:16,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 08:34:16,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:16,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:16,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 08:34:16,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:34:16,698 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:34:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:16,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:34:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 08:34:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152207732] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 08:34:16,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:34:16,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 21 [2025-02-08 08:34:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255280961] [2025-02-08 08:34:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:16,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:34:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:16,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:34:16,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2025-02-08 08:34:17,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-02-08 08:34:17,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 195 flow. Second operand has 10 states, 10 states have (on average 30.5) internal successors, (305), 10 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:17,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:17,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-02-08 08:34:17,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:17,300 INFO L124 PetriNetUnfolderBase]: 237/522 cut-off events. [2025-02-08 08:34:17,300 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-02-08 08:34:17,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 522 events. 237/522 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2546 event pairs, 90 based on Foata normal form. 37/547 useless extension candidates. Maximal degree in co-relation 1065. Up to 220 conditions per place. [2025-02-08 08:34:17,303 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 48 selfloop transitions, 3 changer transitions 4/62 dead transitions. [2025-02-08 08:34:17,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 327 flow [2025-02-08 08:34:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:34:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:34:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2025-02-08 08:34:17,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2025-02-08 08:34:17,304 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 195 flow. Second operand 5 states and 178 transitions. [2025-02-08 08:34:17,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 327 flow [2025-02-08 08:34:17,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:34:17,306 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 188 flow [2025-02-08 08:34:17,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2025-02-08 08:34:17,306 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -7 predicate places. [2025-02-08 08:34:17,307 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 188 flow [2025-02-08 08:34:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.5) internal successors, (305), 10 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:34:17,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:34:17,307 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:17,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:34:17,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:34:17,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 08:34:17,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:34:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 71476256, now seen corresponding path program 1 times [2025-02-08 08:34:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:34:17,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086043141] [2025-02-08 08:34:17,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:34:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:34:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 08:34:17,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 08:34:17,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:34:17,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:34:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-08 08:34:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:34:17,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086043141] [2025-02-08 08:34:17,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086043141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:34:17,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:34:17,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:34:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108046555] [2025-02-08 08:34:17,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:34:17,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:34:17,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:34:17,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:34:17,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:34:17,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-02-08 08:34:17,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:34:17,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:34:17,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-02-08 08:34:17,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:34:17,657 INFO L124 PetriNetUnfolderBase]: 127/317 cut-off events. [2025-02-08 08:34:17,658 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 08:34:17,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 317 events. 127/317 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1292 event pairs, 20 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 655. Up to 169 conditions per place. [2025-02-08 08:34:17,658 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2025-02-08 08:34:17,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 313 flow [2025-02-08 08:34:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:34:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:34:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-02-08 08:34:17,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-02-08 08:34:17,659 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 188 flow. Second operand 3 states and 122 transitions. [2025-02-08 08:34:17,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 313 flow [2025-02-08 08:34:17,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 307 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:34:17,660 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-02-08 08:34:17,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-02-08 08:34:17,661 INFO L279 CegarLoopForPetriNet]: 63 programPoint places, -12 predicate places. [2025-02-08 08:34:17,661 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-02-08 08:34:17,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:34:17,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (16 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2025-02-08 08:34:17,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 35 remaining) [2025-02-08 08:34:17,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 35 remaining) [2025-02-08 08:34:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:34:17,665 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:34:17,669 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:34:17,669 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:34:17,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:34:17 BasicIcfg [2025-02-08 08:34:17,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:34:17,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:34:17,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:34:17,674 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:34:17,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:34:01" (3/4) ... [2025-02-08 08:34:17,676 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:34:17,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:34:17,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:34:17,677 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:34:17,681 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2025-02-08 08:34:17,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2025-02-08 08:34:17,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 08:34:17,683 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:34:17,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:34:17,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:34:17,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:34:17,748 INFO L158 Benchmark]: Toolchain (without parser) took 17093.87ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 112.6MB in the beginning and 115.6MB in the end (delta: -3.0MB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,748 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:34:17,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.18ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.21ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,749 INFO L158 Benchmark]: Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:34:17,750 INFO L158 Benchmark]: IcfgBuilder took 717.23ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 87.3MB in the end (delta: 7.8MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,750 INFO L158 Benchmark]: TraceAbstraction took 16038.59ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 87.3MB in the beginning and 124.0MB in the end (delta: -36.7MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,750 INFO L158 Benchmark]: Witness Printer took 72.96ms. Allocated memory is still 343.9MB. Free memory was 124.0MB in the beginning and 115.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:34:17,752 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.15ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 176.18ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.0MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.21ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 97.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.73ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 717.23ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 87.3MB in the end (delta: 7.8MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16038.59ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 87.3MB in the beginning and 124.0MB in the end (delta: -36.7MB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. * Witness Printer took 72.96ms. Allocated memory is still 343.9MB. Free memory was 124.0MB in the beginning and 115.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 90]: 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, 91 locations, 35 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: 16.0s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2588 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2154 mSDsluCounter, 759 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 730 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7037 IncrementalHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 29 mSDtfsCounter, 7037 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=4, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 733 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 979 ConstructedInterpolants, 93 QuantifiedInterpolants, 10734 SizeOfPredicates, 48 NumberOfNonLiveVariables, 2676 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 33 InterpolantComputations, 11 PerfectInterpolantSequences, 1540/1752 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:34:17,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE