./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_dekker.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_dekker.i -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 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:01,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:02,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:02,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:02,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:02,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:02,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:02,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:02,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:02,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:02,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:02,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:02,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:02,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:02,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:02,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:02,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:02,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:02,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:02,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:02,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:02,040 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 -> 14b6c4171d4b04e355b9ddd303f20c8b3e4e81d04535a1ef986d499534108e49 [2025-02-07 21:25:02,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:02,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:02,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:02,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:02,290 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:02,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-02-07 21:25:03,451 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4312c2d56/c302938be3d9441ea8fe15aaa468cf88/FLAG1d25612c4 [2025-02-07 21:25:03,784 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:03,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_dekker.i [2025-02-07 21:25:03,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4312c2d56/c302938be3d9441ea8fe15aaa468cf88/FLAG1d25612c4 [2025-02-07 21:25:04,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4312c2d56/c302938be3d9441ea8fe15aaa468cf88 [2025-02-07 21:25:04,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:04,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:04,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:04,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:04,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:04,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@faa1059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04, skipping insertion in model container [2025-02-07 21:25:04,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:04,210 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/seq-pthread/cs_dekker.i[23603,23616] [2025-02-07 21:25:04,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:04,276 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:04,298 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/seq-pthread/cs_dekker.i[23603,23616] [2025-02-07 21:25:04,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:04,378 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:04,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04 WrapperNode [2025-02-07 21:25:04,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:04,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:04,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:04,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:04,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,423 INFO L138 Inliner]: procedures = 145, calls = 309, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 457 [2025-02-07 21:25:04,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:04,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:04,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:04,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:04,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,450 INFO L175 MemorySlicer]: Split 158 memory accesses to 18 slices as follows [2, 5, 8, 8, 8, 29, 21, 7, 7, 9, 5, 7, 6, 5, 0, 5, 13, 13]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 3, 3, 3, 9, 9, 3, 3, 3, 0, 3, 2, 0, 0, 0, 0, 0]. The 39 writes are split as follows [0, 1, 2, 2, 2, 11, 6, 2, 2, 2, 1, 2, 2, 1, 0, 1, 1, 1]. [2025-02-07 21:25:04,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:04,479 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:04,479 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:04,479 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:04,480 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (1/1) ... [2025-02-07 21:25:04,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:04,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:04,508 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-07 21:25:04,516 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-07 21:25:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:04,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:04,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:04,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:04,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:04,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:04,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:04,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:04,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:04,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:04,772 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:04,774 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:09,263 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:09,263 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:09,270 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:09,271 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:09,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:09 BoogieIcfgContainer [2025-02-07 21:25:09,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:09,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:09,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:09,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:09,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:04" (1/3) ... [2025-02-07 21:25:09,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651c422d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:09, skipping insertion in model container [2025-02-07 21:25:09,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:04" (2/3) ... [2025-02-07 21:25:09,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651c422d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:09, skipping insertion in model container [2025-02-07 21:25:09,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:09" (3/3) ... [2025-02-07 21:25:09,277 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_dekker.i [2025-02-07 21:25:09,287 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:09,288 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_dekker.i that has 6 procedures, 114 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:09,325 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:09,333 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;@1db579d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:09,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 21:25:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-07 21:25:09,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:09,346 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-07 21:25:09,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:09,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash 107776642, now seen corresponding path program 1 times [2025-02-07 21:25:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51528738] [2025-02-07 21:25:09,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:09,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-07 21:25:09,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-07 21:25:09,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:09,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51528738] [2025-02-07 21:25:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51528738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:09,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134249319] [2025-02-07 21:25:09,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:09,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:09,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:09,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:09,893 INFO L87 Difference]: Start difference. First operand has 114 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:10,435 INFO L93 Difference]: Finished difference Result 227 states and 362 transitions. [2025-02-07 21:25:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:10,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-02-07 21:25:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:10,442 INFO L225 Difference]: With dead ends: 227 [2025-02-07 21:25:10,442 INFO L226 Difference]: Without dead ends: 112 [2025-02-07 21:25:10,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:10,447 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 2 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:10,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:25:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-07 21:25:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-02-07 21:25:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 21:25:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2025-02-07 21:25:10,476 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 130 [2025-02-07 21:25:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2025-02-07 21:25:10,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:10,477 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2025-02-07 21:25:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-07 21:25:10,480 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:10,480 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-07 21:25:10,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:10,480 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:10,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1417379888, now seen corresponding path program 1 times [2025-02-07 21:25:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:10,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919974454] [2025-02-07 21:25:10,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:10,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-07 21:25:10,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-07 21:25:10,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:10,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919974454] [2025-02-07 21:25:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919974454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:10,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562727237] [2025-02-07 21:25:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:10,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:10,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:10,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:10,729 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:10,754 INFO L93 Difference]: Finished difference Result 221 states and 310 transitions. [2025-02-07 21:25:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:10,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-02-07 21:25:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:10,756 INFO L225 Difference]: With dead ends: 221 [2025-02-07 21:25:10,756 INFO L226 Difference]: Without dead ends: 112 [2025-02-07 21:25:10,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:10,757 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:10,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-07 21:25:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-07 21:25:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 21:25:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2025-02-07 21:25:10,767 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 132 [2025-02-07 21:25:10,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:10,767 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2025-02-07 21:25:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2025-02-07 21:25:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-07 21:25:10,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:10,769 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 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-07 21:25:10,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:10,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:10,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1357860452, now seen corresponding path program 1 times [2025-02-07 21:25:10,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:10,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582749530] [2025-02-07 21:25:10,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:10,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 21:25:10,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 21:25:10,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:10,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582749530] [2025-02-07 21:25:11,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582749530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963241080] [2025-02-07 21:25:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:11,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:11,040 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-07 21:25:11,042 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-07 21:25:11,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 21:25:11,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 21:25:11,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:11,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:11,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:11,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:11,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963241080] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:11,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076384026] [2025-02-07 21:25:11,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:11,548 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:11,580 INFO L93 Difference]: Finished difference Result 224 states and 314 transitions. [2025-02-07 21:25:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 133 [2025-02-07 21:25:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:11,582 INFO L225 Difference]: With dead ends: 224 [2025-02-07 21:25:11,582 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 21:25:11,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:11,583 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:11,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:11,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 21:25:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-07 21:25:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 21:25:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-02-07 21:25:11,591 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 133 [2025-02-07 21:25:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:11,591 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-02-07 21:25:11,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-02-07 21:25:11,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-07 21:25:11,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:11,593 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 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, 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-07 21:25:11,601 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-07 21:25:11,793 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-07 21:25:11,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:11,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:11,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1322240996, now seen corresponding path program 2 times [2025-02-07 21:25:11,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:11,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66130099] [2025-02-07 21:25:11,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:11,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:11,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-07 21:25:11,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 135 statements. [2025-02-07 21:25:11,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:12,024 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-02-07 21:25:12,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:12,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66130099] [2025-02-07 21:25:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66130099] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216643240] [2025-02-07 21:25:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:12,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:12,026 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:12,057 INFO L93 Difference]: Finished difference Result 219 states and 308 transitions. [2025-02-07 21:25:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-02-07 21:25:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:12,061 INFO L225 Difference]: With dead ends: 219 [2025-02-07 21:25:12,061 INFO L226 Difference]: Without dead ends: 173 [2025-02-07 21:25:12,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:12,062 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 100 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:12,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 501 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:12,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-07 21:25:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-02-07 21:25:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 113 states have internal predecessors, (138), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-07 21:25:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 240 transitions. [2025-02-07 21:25:12,077 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 240 transitions. Word has length 135 [2025-02-07 21:25:12,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:12,077 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 240 transitions. [2025-02-07 21:25:12,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:12,077 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 240 transitions. [2025-02-07 21:25:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-07 21:25:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:12,080 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 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, 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, 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-07 21:25:12,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:12,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:12,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash -31192417, now seen corresponding path program 1 times [2025-02-07 21:25:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019734612] [2025-02-07 21:25:12,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:12,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 21:25:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 21:25:12,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:12,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-02-07 21:25:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019734612] [2025-02-07 21:25:12,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019734612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:12,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732062523] [2025-02-07 21:25:12,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:12,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:12,405 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-07 21:25:12,407 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-07 21:25:12,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-07 21:25:12,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-07 21:25:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:12,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:12,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:12,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-02-07 21:25:12,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1390 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-02-07 21:25:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732062523] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:13,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:13,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-02-07 21:25:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028686324] [2025-02-07 21:25:13,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:13,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:13,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:13,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:13,095 INFO L87 Difference]: Start difference. First operand 173 states and 240 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2025-02-07 21:25:17,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:21,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:21,459 INFO L93 Difference]: Finished difference Result 349 states and 485 transitions. [2025-02-07 21:25:21,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:21,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 237 [2025-02-07 21:25:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:21,462 INFO L225 Difference]: With dead ends: 349 [2025-02-07 21:25:21,462 INFO L226 Difference]: Without dead ends: 183 [2025-02-07 21:25:21,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:21,463 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 2 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:21,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 449 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2025-02-07 21:25:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-07 21:25:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2025-02-07 21:25:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 123 states have (on average 1.2195121951219512) internal successors, (150), 123 states have internal predecessors, (150), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (53), 49 states have call predecessors, (53), 49 states have call successors, (53) [2025-02-07 21:25:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 252 transitions. [2025-02-07 21:25:21,487 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 252 transitions. Word has length 237 [2025-02-07 21:25:21,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:21,487 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 252 transitions. [2025-02-07 21:25:21,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 2 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2025-02-07 21:25:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 252 transitions. [2025-02-07 21:25:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 21:25:21,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:21,492 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 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, 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, 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-07 21:25:21,509 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-07 21:25:21,693 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-07 21:25:21,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2035492641, now seen corresponding path program 2 times [2025-02-07 21:25:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316661161] [2025-02-07 21:25:21,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:21,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 247 statements into 2 equivalence classes. [2025-02-07 21:25:21,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 247 statements. [2025-02-07 21:25:21,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:21,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-02-07 21:25:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316661161] [2025-02-07 21:25:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316661161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937536316] [2025-02-07 21:25:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:22,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:22,016 INFO L87 Difference]: Start difference. First operand 183 states and 252 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-07 21:25:26,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:30,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:30,161 INFO L93 Difference]: Finished difference Result 489 states and 678 transitions. [2025-02-07 21:25:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:30,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 247 [2025-02-07 21:25:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:30,165 INFO L225 Difference]: With dead ends: 489 [2025-02-07 21:25:30,166 INFO L226 Difference]: Without dead ends: 339 [2025-02-07 21:25:30,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:30,167 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 139 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:30,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 639 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-07 21:25:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-07 21:25:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2025-02-07 21:25:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 219 states have internal predecessors, (264), 95 states have call successors, (95), 20 states have call predecessors, (95), 20 states have return successors, (110), 95 states have call predecessors, (110), 95 states have call successors, (110) [2025-02-07 21:25:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 469 transitions. [2025-02-07 21:25:30,208 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 469 transitions. Word has length 247 [2025-02-07 21:25:30,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:30,208 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 469 transitions. [2025-02-07 21:25:30,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-07 21:25:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 469 transitions. [2025-02-07 21:25:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 21:25:30,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:30,211 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 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, 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, 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-07 21:25:30,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:30,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:30,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:30,215 INFO L85 PathProgramCache]: Analyzing trace with hash -909242049, now seen corresponding path program 1 times [2025-02-07 21:25:30,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:30,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027151207] [2025-02-07 21:25:30,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:30,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:30,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 21:25:30,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 21:25:30,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:30,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-02-07 21:25:30,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:30,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027151207] [2025-02-07 21:25:30,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027151207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:30,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:30,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296096061] [2025-02-07 21:25:30,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:30,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:30,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:30,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:30,923 INFO L87 Difference]: Start difference. First operand 335 states and 469 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-07 21:25:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:32,165 INFO L93 Difference]: Finished difference Result 611 states and 842 transitions. [2025-02-07 21:25:32,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 247 [2025-02-07 21:25:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:32,167 INFO L225 Difference]: With dead ends: 611 [2025-02-07 21:25:32,167 INFO L226 Difference]: Without dead ends: 304 [2025-02-07 21:25:32,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:32,169 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 135 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:32,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 644 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 21:25:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-07 21:25:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2025-02-07 21:25:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 196 states have (on average 1.1938775510204083) internal successors, (234), 196 states have internal predecessors, (234), 85 states have call successors, (85), 18 states have call predecessors, (85), 18 states have return successors, (93), 85 states have call predecessors, (93), 85 states have call successors, (93) [2025-02-07 21:25:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 412 transitions. [2025-02-07 21:25:32,185 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 412 transitions. Word has length 247 [2025-02-07 21:25:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:32,186 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 412 transitions. [2025-02-07 21:25:32,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-07 21:25:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 412 transitions. [2025-02-07 21:25:32,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-07 21:25:32,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:32,189 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 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, 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, 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-07 21:25:32,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:32,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:32,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:32,189 INFO L85 PathProgramCache]: Analyzing trace with hash -995495521, now seen corresponding path program 1 times [2025-02-07 21:25:32,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:32,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845944532] [2025-02-07 21:25:32,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:32,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 21:25:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 21:25:32,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:32,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2025-02-07 21:25:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845944532] [2025-02-07 21:25:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845944532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927701537] [2025-02-07 21:25:32,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:32,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:32,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:32,718 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-07 21:25:32,720 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-07 21:25:33,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-07 21:25:33,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-07 21:25:33,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:33,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:33,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 1845 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 21:25:33,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2025-02-07 21:25:33,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:33,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927701537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:33,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:33,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:25:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313792209] [2025-02-07 21:25:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:33,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:33,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:33,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:33,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:25:33,531 INFO L87 Difference]: Start difference. First operand 300 states and 412 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-07 21:25:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:34,123 INFO L93 Difference]: Finished difference Result 686 states and 925 transitions. [2025-02-07 21:25:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:25:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 247 [2025-02-07 21:25:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:34,126 INFO L225 Difference]: With dead ends: 686 [2025-02-07 21:25:34,126 INFO L226 Difference]: Without dead ends: 343 [2025-02-07 21:25:34,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:34,128 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 158 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:34,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 367 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:25:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-02-07 21:25:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 340. [2025-02-07 21:25:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 222 states have (on average 1.1531531531531531) internal successors, (256), 224 states have internal predecessors, (256), 92 states have call successors, (92), 25 states have call predecessors, (92), 25 states have return successors, (106), 90 states have call predecessors, (106), 92 states have call successors, (106) [2025-02-07 21:25:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 454 transitions. [2025-02-07 21:25:34,150 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 454 transitions. Word has length 247 [2025-02-07 21:25:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 454 transitions. [2025-02-07 21:25:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-02-07 21:25:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 454 transitions. [2025-02-07 21:25:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-07 21:25:34,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:34,153 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 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, 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, 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-07 21:25:34,171 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-07 21:25:34,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:34,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:34,355 INFO L85 PathProgramCache]: Analyzing trace with hash -233427936, now seen corresponding path program 1 times [2025-02-07 21:25:34,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:34,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091537969] [2025-02-07 21:25:34,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:34,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 21:25:34,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 21:25:34,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:34,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2025-02-07 21:25:34,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091537969] [2025-02-07 21:25:34,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091537969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:34,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779664854] [2025-02-07 21:25:34,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:34,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:34,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:34,805 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-07 21:25:34,808 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-07 21:25:35,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 21:25:35,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 21:25:35,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:35,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:35,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:25:35,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 480 proven. 4 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2025-02-07 21:25:35,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2025-02-07 21:25:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779664854] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:35,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:25:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501679018] [2025-02-07 21:25:35,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:35,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:25:35,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:35,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:25:35,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:25:35,860 INFO L87 Difference]: Start difference. First operand 340 states and 454 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (64), 5 states have call predecessors, (64), 6 states have return successors, (65), 7 states have call predecessors, (65), 9 states have call successors, (65) [2025-02-07 21:25:37,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:38,466 INFO L93 Difference]: Finished difference Result 668 states and 898 transitions. [2025-02-07 21:25:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:25:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (64), 5 states have call predecessors, (64), 6 states have return successors, (65), 7 states have call predecessors, (65), 9 states have call successors, (65) Word has length 245 [2025-02-07 21:25:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:38,470 INFO L225 Difference]: With dead ends: 668 [2025-02-07 21:25:38,470 INFO L226 Difference]: Without dead ends: 363 [2025-02-07 21:25:38,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:25:38,471 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 183 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:38,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 487 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-07 21:25:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-02-07 21:25:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 354. [2025-02-07 21:25:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 235 states have (on average 1.148936170212766) internal successors, (270), 236 states have internal predecessors, (270), 85 states have call successors, (85), 33 states have call predecessors, (85), 33 states have return successors, (108), 84 states have call predecessors, (108), 85 states have call successors, (108) [2025-02-07 21:25:38,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2025-02-07 21:25:38,493 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 245 [2025-02-07 21:25:38,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:38,494 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2025-02-07 21:25:38,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 9 states have call successors, (64), 5 states have call predecessors, (64), 6 states have return successors, (65), 7 states have call predecessors, (65), 9 states have call successors, (65) [2025-02-07 21:25:38,494 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2025-02-07 21:25:38,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-07 21:25:38,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:38,496 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 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, 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, 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-07 21:25:38,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 21:25:38,697 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,SelfDestructingSolverStorable8 [2025-02-07 21:25:38,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:38,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1485930528, now seen corresponding path program 1 times [2025-02-07 21:25:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764716106] [2025-02-07 21:25:38,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:38,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:38,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 21:25:38,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 21:25:38,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:38,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1448 trivial. 0 not checked. [2025-02-07 21:25:40,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764716106] [2025-02-07 21:25:40,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764716106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:40,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411359674] [2025-02-07 21:25:40,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:40,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:40,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:40,050 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-07 21:25:40,051 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-07 21:25:40,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-07 21:25:40,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-07 21:25:40,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:40,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:40,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1940 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-07 21:25:40,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:40,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 13 treesize of output 9 [2025-02-07 21:25:47,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:25:47,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:25:47,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-02-07 21:25:49,043 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-07 21:25:49,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-02-07 21:26:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 579 proven. 4 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2025-02-07 21:26:25,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:25,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 23 [2025-02-07 21:26:25,959 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 35 treesize of output 31 [2025-02-07 21:26:26,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 18 [2025-02-07 21:26:26,327 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 26 treesize of output 22 [2025-02-07 21:26:26,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 18 [2025-02-07 21:26:26,379 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 26 treesize of output 22 [2025-02-07 21:26:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1455 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1451 trivial. 0 not checked. [2025-02-07 21:26:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411359674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:26,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 9] total 34 [2025-02-07 21:26:26,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108069879] [2025-02-07 21:26:26,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 21:26:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:26,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 21:26:26,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=986, Unknown=3, NotChecked=0, Total=1122 [2025-02-07 21:26:26,478 INFO L87 Difference]: Start difference. First operand 354 states and 463 transitions. Second operand has 34 states, 31 states have (on average 4.935483870967742) internal successors, (153), 34 states have internal predecessors, (153), 19 states have call successors, (77), 11 states have call predecessors, (77), 14 states have return successors, (77), 17 states have call predecessors, (77), 19 states have call successors, (77) [2025-02-07 21:26:30,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:34,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:38,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []