./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:52:48,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:52:48,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:52:48,189 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:52:48,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:52:48,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:52:48,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:52:48,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:52:48,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:52:48,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:52:48,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:52:48,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:52:48,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:52:48,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:52:48,214 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:52:48,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:52:48,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:52:48,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:52:48,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:52:48,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:52:48,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:52:48,217 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 ! call(reach_error())) ) 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 -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-02-05 14:52:48,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:52:48,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:52:48,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:52:48,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:52:48,487 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:52:48,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-05 14:52:49,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd14dfd81/e49aec70443747a88534e37e8e38a891/FLAG6d95e124d [2025-02-05 14:52:50,015 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:52:50,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-02-05 14:52:50,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd14dfd81/e49aec70443747a88534e37e8e38a891/FLAG6d95e124d [2025-02-05 14:52:50,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd14dfd81/e49aec70443747a88534e37e8e38a891 [2025-02-05 14:52:50,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:52:50,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:52:50,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:52:50,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:52:50,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:52:50,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e500d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50, skipping insertion in model container [2025-02-05 14:52:50,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:52:50,259 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[5067,5080] [2025-02-05 14:52:50,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:52:50,404 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:52:50,430 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c[5067,5080] [2025-02-05 14:52:50,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:52:50,521 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:52:50,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50 WrapperNode [2025-02-05 14:52:50,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:52:50,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:52:50,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:52:50,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:52:50,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,552 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,600 INFO L138 Inliner]: procedures = 37, calls = 248, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 509 [2025-02-05 14:52:50,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:52:50,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:52:50,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:52:50,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:52:50,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,650 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 12, 4, 100, 10, 42, 11]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 1, 97, 0, 39, 11]. [2025-02-05 14:52:50,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:52:50,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:52:50,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:52:50,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:52:50,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (1/1) ... [2025-02-05 14:52:50,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:52:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:52:50,730 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-05 14:52:50,736 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-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-05 14:52:50,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-05 14:52:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-05 14:52:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-05 14:52:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 14:52:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:52:50,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:52:50,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-05 14:52:50,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-05 14:52:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-05 14:52:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-05 14:52:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-05 14:52:50,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-05 14:52:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-05 14:52:50,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-05 14:52:50,761 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-05 14:52:50,763 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 14:52:50,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:52:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:52:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:52:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 14:52:50,764 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 14:52:50,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:52:50,919 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:52:50,921 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:52:51,634 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2025-02-05 14:52:51,634 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem97#1; [2025-02-05 14:52:51,635 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-02-05 14:52:51,635 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem102#1; [2025-02-05 14:52:51,635 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2025-02-05 14:52:51,696 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-02-05 14:52:51,697 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:52:51,716 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:52:51,716 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:52:51,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:52:51 BoogieIcfgContainer [2025-02-05 14:52:51,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:52:51,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:52:51,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:52:51,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:52:51,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:52:50" (1/3) ... [2025-02-05 14:52:51,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c2ddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:52:51, skipping insertion in model container [2025-02-05 14:52:51,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:52:50" (2/3) ... [2025-02-05 14:52:51,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c2ddbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:52:51, skipping insertion in model container [2025-02-05 14:52:51,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:52:51" (3/3) ... [2025-02-05 14:52:51,728 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-02-05 14:52:51,740 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:52:51,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 105 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-02-05 14:52:51,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:52:51,795 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=LoopHeads, 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;@161e18d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:52:51,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:52:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:52:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:52:51,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:52:51,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:52:51,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:52:51,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:52:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1135283960, now seen corresponding path program 1 times [2025-02-05 14:52:51,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:52:51,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187362287] [2025-02-05 14:52:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:52:52,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:52:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:52:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:53,297 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-05 14:52:53,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:52:53,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187362287] [2025-02-05 14:52:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187362287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:52:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:52:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:52:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602163841] [2025-02-05 14:52:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:52:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:52:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:52:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:52:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:52:53,325 INFO L87 Difference]: Start difference. First operand has 85 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:52:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:52:53,465 INFO L93 Difference]: Finished difference Result 197 states and 302 transitions. [2025-02-05 14:52:53,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:52:53,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-02-05 14:52:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:52:53,475 INFO L225 Difference]: With dead ends: 197 [2025-02-05 14:52:53,476 INFO L226 Difference]: Without dead ends: 98 [2025-02-05 14:52:53,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:52:53,484 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 45 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:52:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 544 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:52:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-05 14:52:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2025-02-05 14:52:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:52:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-02-05 14:52:53,528 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 38 [2025-02-05 14:52:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:52:53,528 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-02-05 14:52:53,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:52:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-02-05 14:52:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:52:53,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:52:53,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:52:53,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:52:53,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:52:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:52:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2134191337, now seen corresponding path program 1 times [2025-02-05 14:52:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:52:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665993169] [2025-02-05 14:52:53,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:52:54,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:52:54,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:52:54,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:54,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:54,645 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-05 14:52:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:52:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665993169] [2025-02-05 14:52:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665993169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:52:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:52:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:52:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457726884] [2025-02-05 14:52:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:52:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:52:54,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:52:54,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:52:54,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:52:54,650 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:52:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:52:54,714 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2025-02-05 14:52:54,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:52:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-02-05 14:52:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:52:54,716 INFO L225 Difference]: With dead ends: 111 [2025-02-05 14:52:54,716 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 14:52:54,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:52:54,717 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:52:54,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 354 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:52:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 14:52:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-05 14:52:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:52:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-02-05 14:52:54,725 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 38 [2025-02-05 14:52:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:52:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-02-05 14:52:54,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:52:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-02-05 14:52:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 14:52:54,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:52:54,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:52:54,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:52:54,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:52:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:52:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1650241782, now seen corresponding path program 1 times [2025-02-05 14:52:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:52:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046199956] [2025-02-05 14:52:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:52:55,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 14:52:55,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 14:52:55,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:55,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:55,802 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-05 14:52:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:52:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046199956] [2025-02-05 14:52:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046199956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:52:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:52:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:52:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330478368] [2025-02-05 14:52:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:52:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:52:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:52:55,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:52:55,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:52:55,805 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:52:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:52:55,826 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2025-02-05 14:52:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:52:55,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-02-05 14:52:55,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:52:55,830 INFO L225 Difference]: With dead ends: 130 [2025-02-05 14:52:55,830 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 14:52:55,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:52:55,831 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:52:55,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:52:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 14:52:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-05 14:52:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:52:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2025-02-05 14:52:55,842 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 38 [2025-02-05 14:52:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:52:55,842 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-02-05 14:52:55,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:52:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2025-02-05 14:52:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 14:52:55,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:52:55,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:52:55,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:52:55,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:52:55,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:52:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1675688228, now seen corresponding path program 1 times [2025-02-05 14:52:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:52:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394034950] [2025-02-05 14:52:55,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:52:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:52:56,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:52:56,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:52:56,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:52:56,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394034950] [2025-02-05 14:52:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394034950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:52:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439763279] [2025-02-05 14:52:56,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:52:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:52:56,919 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-05 14:52:56,921 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-05 14:52:57,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 14:52:57,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 14:52:57,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:57,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:57,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 14:52:57,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:52:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:52:57,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:52:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:52:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439763279] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 14:52:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 14:52:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 6] total 10 [2025-02-05 14:52:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737528014] [2025-02-05 14:52:58,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:52:58,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:52:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:52:58,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:52:58,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:52:58,032 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:52:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:52:58,062 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2025-02-05 14:52:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:52:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-02-05 14:52:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:52:58,064 INFO L225 Difference]: With dead ends: 111 [2025-02-05 14:52:58,064 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 14:52:58,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:52:58,065 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:52:58,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:52:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 14:52:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-05 14:52:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:52:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-02-05 14:52:58,082 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 39 [2025-02-05 14:52:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:52:58,082 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-02-05 14:52:58,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:52:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2025-02-05 14:52:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 14:52:58,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:52:58,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:52:58,093 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-05 14:52:58,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:52:58,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:52:58,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:52:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 997538000, now seen corresponding path program 1 times [2025-02-05 14:52:58,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:52:58,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431047651] [2025-02-05 14:52:58,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:52:59,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:52:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:52:59,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:52:59,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:52:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:52:59,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:52:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431047651] [2025-02-05 14:52:59,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431047651] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:52:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611465231] [2025-02-05 14:52:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:52:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:52:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:52:59,341 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-05 14:52:59,343 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-05 14:53:00,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 14:53:00,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 14:53:00,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:53:00,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:53:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 14:53:00,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:53:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:53:00,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:53:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:53:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611465231] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:53:00,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:53:00,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 14:53:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428043700] [2025-02-05 14:53:00,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:53:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 14:53:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:53:00,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 14:53:00,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-05 14:53:00,550 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:53:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:53:00,603 INFO L93 Difference]: Finished difference Result 137 states and 183 transitions. [2025-02-05 14:53:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 14:53:00,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-02-05 14:53:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:53:00,604 INFO L225 Difference]: With dead ends: 137 [2025-02-05 14:53:00,605 INFO L226 Difference]: Without dead ends: 78 [2025-02-05 14:53:00,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 14:53:00,606 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:53:00,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 546 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:53:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-05 14:53:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-05 14:53:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:53:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-02-05 14:53:00,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 40 [2025-02-05 14:53:00,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:53:00,612 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-02-05 14:53:00,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 14:53:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-02-05 14:53:00,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:53:00,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:53:00,613 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:53:00,623 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-05 14:53:00,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:53:00,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:53:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:53:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -818104202, now seen corresponding path program 2 times [2025-02-05 14:53:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:53:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747244595] [2025-02-05 14:53:00,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:53:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:53:01,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 14:53:01,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:53:01,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:53:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:53:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:53:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:53:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747244595] [2025-02-05 14:53:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747244595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:53:01,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861435825] [2025-02-05 14:53:01,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 14:53:01,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:53:01,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:53:01,789 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-05 14:53:01,792 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-05 14:53:02,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 14:54:10,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:54:10,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 14:54:10,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:54:10,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 14:54:10,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:54:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:54:10,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:54:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:54:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861435825] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:54:10,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:54:10,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 17 [2025-02-05 14:54:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867856818] [2025-02-05 14:54:10,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:54:10,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 14:54:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:54:10,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 14:54:10,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-02-05 14:54:10,445 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 14:54:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:54:10,680 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2025-02-05 14:54:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 14:54:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2025-02-05 14:54:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:54:10,681 INFO L225 Difference]: With dead ends: 146 [2025-02-05 14:54:10,681 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 14:54:10,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:54:10,683 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:54:10,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:54:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 14:54:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-05 14:54:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:54:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2025-02-05 14:54:10,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 43 [2025-02-05 14:54:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:54:10,693 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2025-02-05 14:54:10,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 14:54:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2025-02-05 14:54:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 14:54:10,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:54:10,694 INFO L218 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:54:10,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 14:54:10,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:54:10,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:54:10,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:54:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash -893407050, now seen corresponding path program 3 times [2025-02-05 14:54:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:54:10,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821701764] [2025-02-05 14:54:10,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:54:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:54:11,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 6 equivalence classes. [2025-02-05 14:54:11,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 50 statements. [2025-02-05 14:54:11,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 14:54:11,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:54:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 14:54:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:54:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821701764] [2025-02-05 14:54:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821701764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:54:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159911567] [2025-02-05 14:54:11,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 14:54:11,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:54:11,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:54:11,837 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-05 14:54:11,839 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-05 14:54:12,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 6 equivalence classes.