./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 14:39:14,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 14:39:14,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-02-06 14:39:14,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 14:39:14,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 14:39:14,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 14:39:14,463 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 14:39:14,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 14:39:14,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 14:39:14,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 14:39:14,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 14:39:14,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 14:39:14,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 14:39:14,465 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 14:39:14,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:39:14,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 14:39:14,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 14:39:14,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 14:39:14,467 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2025-02-06 14:39:14,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 14:39:14,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 14:39:14,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 14:39:14,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 14:39:14,863 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 14:39:14,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 14:39:16,072 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7172cfe1c/c4100f45f76a41ca89d4c153ad0ca747/FLAG4523263fa [2025-02-06 14:39:16,490 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 14:39:16,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 14:39:16,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7172cfe1c/c4100f45f76a41ca89d4c153ad0ca747/FLAG4523263fa [2025-02-06 14:39:16,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7172cfe1c/c4100f45f76a41ca89d4c153ad0ca747 [2025-02-06 14:39:16,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 14:39:16,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 14:39:16,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 14:39:16,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 14:39:16,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 14:39:16,662 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:16" (1/1) ... [2025-02-06 14:39:16,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351c850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:16, skipping insertion in model container [2025-02-06 14:39:16,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:16" (1/1) ... [2025-02-06 14:39:16,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 14:39:17,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:39:17,148 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 14:39:17,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 14:39:17,336 INFO L204 MainTranslator]: Completed translation [2025-02-06 14:39:17,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17 WrapperNode [2025-02-06 14:39:17,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 14:39:17,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 14:39:17,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 14:39:17,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 14:39:17,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,408 INFO L138 Inliner]: procedures = 100, calls = 349, calls flagged for inlining = 41, calls inlined = 33, statements flattened = 817 [2025-02-06 14:39:17,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 14:39:17,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 14:39:17,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 14:39:17,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 14:39:17,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,497 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 14, 12, 65, 103, 32]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 0, 10, 0]. The 204 writes are split as follows [0, 2, 12, 65, 93, 32]. [2025-02-06 14:39:17,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,533 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 14:39:17,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 14:39:17,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 14:39:17,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 14:39:17,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (1/1) ... [2025-02-06 14:39:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 14:39:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:39:17,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 14:39:17,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 14:39:17,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 14:39:17,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 14:39:17,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 14:39:17,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 14:39:17,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 14:39:17,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 14:39:17,614 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-02-06 14:39:17,615 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 14:39:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 14:39:17,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-06 14:39:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-06 14:39:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 14:39:17,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-02-06 14:39:17,617 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-02-06 14:39:17,617 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 14:39:17,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 14:39:17,618 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-02-06 14:39:17,618 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-02-06 14:39:17,844 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 14:39:17,845 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 14:39:17,869 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet118; [2025-02-06 14:39:17,897 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret117.base, #t~ret117.offset; [2025-02-06 14:39:17,910 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet105; [2025-02-06 14:39:22,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2025-02-06 14:39:22,901 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300: call ULTIMATE.dealloc(isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset);havoc isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset;call ULTIMATE.dealloc(isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset);havoc isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet119#1; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret120#1.base, regulator_register_#t~ret120#1.offset; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet113#1; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret110#1.base, dev_get_drvdata_#t~ret110#1.offset; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet114#1; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet111#1; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet115#1; [2025-02-06 14:39:22,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret112#1.base, devm_kzalloc_#t~ret112#1.offset; [2025-02-06 14:39:22,982 INFO L? ?]: Removed 267 outVars from TransFormulas that were not future-live. [2025-02-06 14:39:22,983 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 14:39:22,994 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 14:39:22,995 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 14:39:22,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:22 BoogieIcfgContainer [2025-02-06 14:39:22,995 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 14:39:22,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 14:39:22,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 14:39:22,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 14:39:22,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:39:16" (1/3) ... [2025-02-06 14:39:23,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6915df49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:22, skipping insertion in model container [2025-02-06 14:39:23,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:17" (2/3) ... [2025-02-06 14:39:23,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6915df49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:23, skipping insertion in model container [2025-02-06 14:39:23,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:22" (3/3) ... [2025-02-06 14:39:23,001 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-02-06 14:39:23,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 14:39:23,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i that has 12 procedures, 205 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-02-06 14:39:23,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 14:39:23,053 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;@667c8bc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 14:39:23,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-06 14:39:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 175 states have internal predecessors, (218), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 14:39:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 14:39:23,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:23,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:39:23,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:23,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1601106069, now seen corresponding path program 1 times [2025-02-06 14:39:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:23,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771256553] [2025-02-06 14:39:23,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 14:39:25,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 14:39:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:39:25,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771256553] [2025-02-06 14:39:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771256553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:25,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:25,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:39:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580963198] [2025-02-06 14:39:25,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:25,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:39:25,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:25,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:39:25,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:39:25,628 INFO L87 Difference]: Start difference. First operand has 209 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 175 states have internal predecessors, (218), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:25,851 INFO L93 Difference]: Finished difference Result 541 states and 741 transitions. [2025-02-06 14:39:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:39:25,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 14:39:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:25,861 INFO L225 Difference]: With dead ends: 541 [2025-02-06 14:39:25,861 INFO L226 Difference]: Without dead ends: 289 [2025-02-06 14:39:25,864 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-06 14:39:25,868 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 165 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:25,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 537 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:39:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-06 14:39:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-02-06 14:39:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 221 states have (on average 1.334841628959276) internal successors, (295), 231 states have internal predecessors, (295), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 14:39:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 373 transitions. [2025-02-06 14:39:25,930 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 373 transitions. Word has length 17 [2025-02-06 14:39:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:25,930 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 373 transitions. [2025-02-06 14:39:25,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 373 transitions. [2025-02-06 14:39:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 14:39:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:25,932 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:39:25,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 14:39:25,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:25,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:25,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1880596896, now seen corresponding path program 1 times [2025-02-06 14:39:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525269543] [2025-02-06 14:39:25,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:27,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 14:39:27,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 14:39:27,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:27,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 14:39:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525269543] [2025-02-06 14:39:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525269543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:28,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:39:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623255375] [2025-02-06 14:39:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:28,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:39:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:28,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:39:28,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:39:28,085 INFO L87 Difference]: Start difference. First operand 289 states and 373 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:28,287 INFO L93 Difference]: Finished difference Result 469 states and 606 transitions. [2025-02-06 14:39:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:39:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-06 14:39:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:28,293 INFO L225 Difference]: With dead ends: 469 [2025-02-06 14:39:28,295 INFO L226 Difference]: Without dead ends: 465 [2025-02-06 14:39:28,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 14:39:28,296 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 205 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:28,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 453 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:39:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-02-06 14:39:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-02-06 14:39:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 358 states have (on average 1.335195530726257) internal successors, (478), 369 states have internal predecessors, (478), 62 states have call successors, (62), 29 states have call predecessors, (62), 29 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 14:39:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 602 transitions. [2025-02-06 14:39:28,334 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 602 transitions. Word has length 28 [2025-02-06 14:39:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:28,334 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 602 transitions. [2025-02-06 14:39:28,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 602 transitions. [2025-02-06 14:39:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-06 14:39:28,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:28,336 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:39:28,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 14:39:28,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:28,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 255209789, now seen corresponding path program 1 times [2025-02-06 14:39:28,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:28,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268694114] [2025-02-06 14:39:28,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:28,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:30,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 14:39:30,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 14:39:30,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:30,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 14:39:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268694114] [2025-02-06 14:39:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268694114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:30,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:39:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828595482] [2025-02-06 14:39:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:30,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:39:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:30,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:39:30,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:39:30,504 INFO L87 Difference]: Start difference. First operand 459 states and 602 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:39:34,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:35,088 INFO L93 Difference]: Finished difference Result 912 states and 1198 transitions. [2025-02-06 14:39:35,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:39:35,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-02-06 14:39:35,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:35,093 INFO L225 Difference]: With dead ends: 912 [2025-02-06 14:39:35,094 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 14:39:35,094 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-06 14:39:35,095 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 203 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:35,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 536 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 14:39:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 14:39:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-02-06 14:39:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 437 states have (on average 1.3272311212814645) internal successors, (580), 448 states have internal predecessors, (580), 76 states have call successors, (76), 39 states have call predecessors, (76), 39 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 14:39:35,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 732 transitions. [2025-02-06 14:39:35,115 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 732 transitions. Word has length 35 [2025-02-06 14:39:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:35,116 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 732 transitions. [2025-02-06 14:39:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 14:39:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 732 transitions. [2025-02-06 14:39:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 14:39:35,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:35,118 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:39:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 14:39:35,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:35,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1162841676, now seen corresponding path program 1 times [2025-02-06 14:39:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052823846] [2025-02-06 14:39:35,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:36,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 14:39:36,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 14:39:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:36,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 14:39:37,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:37,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052823846] [2025-02-06 14:39:37,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052823846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:37,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:37,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:39:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109050512] [2025-02-06 14:39:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:37,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:39:37,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:37,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:39:37,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:39:37,119 INFO L87 Difference]: Start difference. First operand 562 states and 732 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:41,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:39:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:41,872 INFO L93 Difference]: Finished difference Result 1178 states and 1535 transitions. [2025-02-06 14:39:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 14:39:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-06 14:39:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:41,876 INFO L225 Difference]: With dead ends: 1178 [2025-02-06 14:39:41,876 INFO L226 Difference]: Without dead ends: 880 [2025-02-06 14:39:41,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:39:41,877 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 205 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:41,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1093 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-02-06 14:39:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-02-06 14:39:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 566. [2025-02-06 14:39:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 441 states have (on average 1.3242630385487528) internal successors, (584), 452 states have internal predecessors, (584), 76 states have call successors, (76), 39 states have call predecessors, (76), 39 states have return successors, (76), 76 states have call predecessors, (76), 76 states have call successors, (76) [2025-02-06 14:39:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 736 transitions. [2025-02-06 14:39:41,903 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 736 transitions. Word has length 43 [2025-02-06 14:39:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:41,903 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 736 transitions. [2025-02-06 14:39:41,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 14:39:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 736 transitions. [2025-02-06 14:39:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-06 14:39:41,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:41,904 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:39:41,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 14:39:41,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1740905345, now seen corresponding path program 1 times [2025-02-06 14:39:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:41,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147792222] [2025-02-06 14:39:41,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:43,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 14:39:43,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 14:39:43,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:39:44,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:44,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147792222] [2025-02-06 14:39:44,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147792222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:44,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:44,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:39:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721946878] [2025-02-06 14:39:44,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:39:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:44,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:39:44,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:39:44,241 INFO L87 Difference]: Start difference. First operand 566 states and 736 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:39:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:44,627 INFO L93 Difference]: Finished difference Result 1057 states and 1386 transitions. [2025-02-06 14:39:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:39:44,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2025-02-06 14:39:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:44,633 INFO L225 Difference]: With dead ends: 1057 [2025-02-06 14:39:44,634 INFO L226 Difference]: Without dead ends: 600 [2025-02-06 14:39:44,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 14:39:44,637 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 5 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:44,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 440 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 14:39:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-06 14:39:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-06 14:39:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 469 states have (on average 1.3091684434968016) internal successors, (614), 480 states have internal predecessors, (614), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 14:39:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 778 transitions. [2025-02-06 14:39:44,679 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 778 transitions. Word has length 53 [2025-02-06 14:39:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:44,680 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 778 transitions. [2025-02-06 14:39:44,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 14:39:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 778 transitions. [2025-02-06 14:39:44,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 14:39:44,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:44,683 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 14:39:44,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 14:39:44,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:44,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1649505741, now seen corresponding path program 1 times [2025-02-06 14:39:44,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:44,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650746141] [2025-02-06 14:39:44,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:44,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:46,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 14:39:46,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 14:39:46,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:46,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 14:39:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650746141] [2025-02-06 14:39:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650746141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 14:39:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497679810] [2025-02-06 14:39:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:39:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:46,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:39:46,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:39:46,815 INFO L87 Difference]: Start difference. First operand 600 states and 778 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 14:39:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:47,510 INFO L93 Difference]: Finished difference Result 1093 states and 1420 transitions. [2025-02-06 14:39:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:39:47,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 67 [2025-02-06 14:39:47,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:47,514 INFO L225 Difference]: With dead ends: 1093 [2025-02-06 14:39:47,515 INFO L226 Difference]: Without dead ends: 602 [2025-02-06 14:39:47,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 14:39:47,518 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 2 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:47,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 650 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 14:39:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-02-06 14:39:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2025-02-06 14:39:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 471 states have (on average 1.3078556263269638) internal successors, (616), 482 states have internal predecessors, (616), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 14:39:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 780 transitions. [2025-02-06 14:39:47,553 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 780 transitions. Word has length 67 [2025-02-06 14:39:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:47,555 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 780 transitions. [2025-02-06 14:39:47,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 14:39:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 780 transitions. [2025-02-06 14:39:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-06 14:39:47,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:47,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:39:47,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 14:39:47,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:47,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1871561861, now seen corresponding path program 1 times [2025-02-06 14:39:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762754563] [2025-02-06 14:39:47,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:49,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 14:39:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 14:39:49,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:49,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:39:49,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762754563] [2025-02-06 14:39:49,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762754563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:39:49,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691817127] [2025-02-06 14:39:49,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:39:49,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:39:49,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 14:39:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-06 14:39:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-06 14:39:52,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:52,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:52,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:39:52,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:39:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 14:39:52,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:39:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691817127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:39:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-02-06 14:39:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514576240] [2025-02-06 14:39:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:39:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:52,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:39:52,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:39:52,644 INFO L87 Difference]: Start difference. First operand 602 states and 780 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 14:39:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:53,336 INFO L93 Difference]: Finished difference Result 1099 states and 1432 transitions. [2025-02-06 14:39:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:39:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2025-02-06 14:39:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:53,340 INFO L225 Difference]: With dead ends: 1099 [2025-02-06 14:39:53,340 INFO L226 Difference]: Without dead ends: 606 [2025-02-06 14:39:53,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:39:53,342 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 11 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:53,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 650 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 14:39:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-02-06 14:39:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-02-06 14:39:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 477 states have (on average 1.2955974842767295) internal successors, (618), 484 states have internal predecessors, (618), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 14:39:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 782 transitions. [2025-02-06 14:39:53,358 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 782 transitions. Word has length 73 [2025-02-06 14:39:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:53,358 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 782 transitions. [2025-02-06 14:39:53,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 14:39:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 782 transitions. [2025-02-06 14:39:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 14:39:53,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:53,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 14:39:53,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 14:39:53,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:53,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:53,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2111124200, now seen corresponding path program 1 times [2025-02-06 14:39:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325427771] [2025-02-06 14:39:53,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:55,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 14:39:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 14:39:55,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:55,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 14:39:55,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325427771] [2025-02-06 14:39:55,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325427771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:39:55,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:39:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:39:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911494705] [2025-02-06 14:39:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:39:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:39:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:39:55,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:39:55,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:39:55,441 INFO L87 Difference]: Start difference. First operand 606 states and 782 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:39:55,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:39:55,697 INFO L93 Difference]: Finished difference Result 606 states and 782 transitions. [2025-02-06 14:39:55,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:39:55,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-02-06 14:39:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:39:55,699 INFO L225 Difference]: With dead ends: 606 [2025-02-06 14:39:55,700 INFO L226 Difference]: Without dead ends: 604 [2025-02-06 14:39:55,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 14:39:55,700 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 7 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:39:55,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 422 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:39:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-06 14:39:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600. [2025-02-06 14:39:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 473 states have (on average 1.285412262156448) internal successors, (608), 478 states have internal predecessors, (608), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-06 14:39:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 772 transitions. [2025-02-06 14:39:55,715 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 772 transitions. Word has length 74 [2025-02-06 14:39:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:39:55,715 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 772 transitions. [2025-02-06 14:39:55,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:39:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 772 transitions. [2025-02-06 14:39:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 14:39:55,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:39:55,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 14:39:55,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 14:39:55,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:39:55,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:39:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1907529279, now seen corresponding path program 1 times [2025-02-06 14:39:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:39:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386848382] [2025-02-06 14:39:55,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:39:57,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 14:39:57,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 14:39:57,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:39:57,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:39:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:39:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:39:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386848382] [2025-02-06 14:39:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386848382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:39:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712237498] [2025-02-06 14:39:57,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:39:57,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:39:57,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:39:57,682 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:39:57,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 14:39:59,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 14:40:00,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 14:40:00,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:00,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:00,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:40:00,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:40:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 14:40:00,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:40:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712237498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:40:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 14:40:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898957679] [2025-02-06 14:40:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:40:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:00,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:40:00,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:40:00,222 INFO L87 Difference]: Start difference. First operand 600 states and 772 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:40:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:00,426 INFO L93 Difference]: Finished difference Result 918 states and 1184 transitions. [2025-02-06 14:40:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:40:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2025-02-06 14:40:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:00,429 INFO L225 Difference]: With dead ends: 918 [2025-02-06 14:40:00,429 INFO L226 Difference]: Without dead ends: 605 [2025-02-06 14:40:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:40:00,433 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 3 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 447 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:40:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-06 14:40:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-02-06 14:40:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 477 states have (on average 1.2851153039832286) internal successors, (613), 482 states have internal predecessors, (613), 83 states have call successors, (83), 39 states have call predecessors, (83), 39 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 14:40:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 779 transitions. [2025-02-06 14:40:00,456 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 779 transitions. Word has length 80 [2025-02-06 14:40:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:00,457 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 779 transitions. [2025-02-06 14:40:00,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 14:40:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 779 transitions. [2025-02-06 14:40:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-06 14:40:00,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:00,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 14:40:00,475 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-06 14:40:00,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:00,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:00,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:00,660 INFO L85 PathProgramCache]: Analyzing trace with hash -935729924, now seen corresponding path program 1 times [2025-02-06 14:40:00,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:00,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966554659] [2025-02-06 14:40:00,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:00,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:02,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 14:40:02,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 14:40:02,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:02,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 14:40:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966554659] [2025-02-06 14:40:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966554659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:40:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760481750] [2025-02-06 14:40:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:02,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:02,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:40:02,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:40:02,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 14:40:05,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-06 14:40:05,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-06 14:40:05,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:05,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 14:40:05,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:40:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-06 14:40:05,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:40:05,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760481750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:05,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:40:05,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-06 14:40:05,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460508661] [2025-02-06 14:40:05,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:40:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:05,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:40:05,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:40:05,548 INFO L87 Difference]: Start difference. First operand 605 states and 779 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:40:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:05,732 INFO L93 Difference]: Finished difference Result 605 states and 779 transitions. [2025-02-06 14:40:05,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:40:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 83 [2025-02-06 14:40:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:05,735 INFO L225 Difference]: With dead ends: 605 [2025-02-06 14:40:05,735 INFO L226 Difference]: Without dead ends: 604 [2025-02-06 14:40:05,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 14:40:05,736 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:05,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:40:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-06 14:40:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-02-06 14:40:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 477 states have (on average 1.280922431865828) internal successors, (611), 481 states have internal predecessors, (611), 83 states have call successors, (83), 39 states have call predecessors, (83), 39 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-06 14:40:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 777 transitions. [2025-02-06 14:40:05,752 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 777 transitions. Word has length 83 [2025-02-06 14:40:05,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:05,752 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 777 transitions. [2025-02-06 14:40:05,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 14:40:05,752 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 777 transitions. [2025-02-06 14:40:05,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-06 14:40:05,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:05,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 14:40:05,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 14:40:05,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:05,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1035575110, now seen corresponding path program 1 times [2025-02-06 14:40:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156990906] [2025-02-06 14:40:05,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:05,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:07,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 14:40:07,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 14:40:07,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:40:07,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156990906] [2025-02-06 14:40:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156990906] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:40:07,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201439993] [2025-02-06 14:40:07,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:07,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:07,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:40:07,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:40:07,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 14:40:10,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-06 14:40:10,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-06 14:40:10,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:10,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:10,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:40:10,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:40:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:40:10,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:40:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:40:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201439993] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:40:11,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:40:11,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-06 14:40:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742590395] [2025-02-06 14:40:11,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:40:11,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 14:40:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:11,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 14:40:11,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:40:11,457 INFO L87 Difference]: Start difference. First operand 604 states and 777 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 14:40:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:12,408 INFO L93 Difference]: Finished difference Result 1149 states and 1478 transitions. [2025-02-06 14:40:12,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 14:40:12,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2025-02-06 14:40:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:12,411 INFO L225 Difference]: With dead ends: 1149 [2025-02-06 14:40:12,411 INFO L226 Difference]: Without dead ends: 654 [2025-02-06 14:40:12,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:40:12,412 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 25 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:12,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 844 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 14:40:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-06 14:40:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 634. [2025-02-06 14:40:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 503 states have (on average 1.2703777335984094) internal successors, (639), 507 states have internal predecessors, (639), 87 states have call successors, (87), 39 states have call predecessors, (87), 39 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-06 14:40:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 813 transitions. [2025-02-06 14:40:12,427 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 813 transitions. Word has length 88 [2025-02-06 14:40:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:12,427 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 813 transitions. [2025-02-06 14:40:12,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-06 14:40:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 813 transitions. [2025-02-06 14:40:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-06 14:40:12,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:12,429 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 14:40:12,455 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-06 14:40:12,629 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,SelfDestructingSolverStorable10 [2025-02-06 14:40:12,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:12,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:12,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800325, now seen corresponding path program 1 times [2025-02-06 14:40:12,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:12,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102205782] [2025-02-06 14:40:12,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:14,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 14:40:14,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 14:40:14,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:14,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 14:40:14,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:14,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102205782] [2025-02-06 14:40:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102205782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:40:14,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454602907] [2025-02-06 14:40:14,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:14,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:14,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:40:14,617 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:40:14,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 14:40:16,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-06 14:40:17,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-06 14:40:17,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:17,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:17,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:40:17,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:40:19,299 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:40:19,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 14:40:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454602907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 14:40:19,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-06 14:40:19,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370397374] [2025-02-06 14:40:19,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:19,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 14:40:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:19,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 14:40:19,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:40:19,303 INFO L87 Difference]: Start difference. First operand 634 states and 813 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:40:23,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:40:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:24,487 INFO L93 Difference]: Finished difference Result 827 states and 1062 transitions. [2025-02-06 14:40:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 14:40:24,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2025-02-06 14:40:24,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:24,490 INFO L225 Difference]: With dead ends: 827 [2025-02-06 14:40:24,491 INFO L226 Difference]: Without dead ends: 825 [2025-02-06 14:40:24,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 14:40:24,492 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 346 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:24,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 573 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-02-06 14:40:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-06 14:40:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 632. [2025-02-06 14:40:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 503 states have (on average 1.2664015904572565) internal successors, (637), 505 states have internal predecessors, (637), 87 states have call successors, (87), 39 states have call predecessors, (87), 39 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-06 14:40:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 811 transitions. [2025-02-06 14:40:24,510 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 811 transitions. Word has length 92 [2025-02-06 14:40:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:24,510 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 811 transitions. [2025-02-06 14:40:24,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-06 14:40:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 811 transitions. [2025-02-06 14:40:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-06 14:40:24,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:24,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-06 14:40:24,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 14:40:24,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 14:40:24,713 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:24,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash -251895400, now seen corresponding path program 1 times [2025-02-06 14:40:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:24,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650015946] [2025-02-06 14:40:24,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:26,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 14:40:26,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 14:40:26,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:26,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 14:40:26,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650015946] [2025-02-06 14:40:26,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650015946] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 14:40:26,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868915510] [2025-02-06 14:40:26,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:26,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 14:40:26,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 14:40:26,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 14:40:26,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 14:40:29,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 14:40:29,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 14:40:29,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:29,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:29,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 14:40:29,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 14:40:31,512 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 14:40:31,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 14:40:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 14:40:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868915510] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 14:40:33,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 14:40:33,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-02-06 14:40:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243132487] [2025-02-06 14:40:33,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 14:40:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 14:40:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:33,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 14:40:33,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 14:40:33,403 INFO L87 Difference]: Start difference. First operand 632 states and 811 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 14:40:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:35,965 INFO L93 Difference]: Finished difference Result 1492 states and 1923 transitions. [2025-02-06 14:40:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 14:40:35,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 93 [2025-02-06 14:40:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:35,974 INFO L225 Difference]: With dead ends: 1492 [2025-02-06 14:40:35,974 INFO L226 Difference]: Without dead ends: 1162 [2025-02-06 14:40:35,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-02-06 14:40:35,975 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 651 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:35,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1002 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 14:40:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-02-06 14:40:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 968. [2025-02-06 14:40:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 773 states have (on average 1.2626131953428201) internal successors, (976), 774 states have internal predecessors, (976), 134 states have call successors, (134), 59 states have call predecessors, (134), 59 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 14:40:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1244 transitions. [2025-02-06 14:40:36,027 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1244 transitions. Word has length 93 [2025-02-06 14:40:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:36,028 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1244 transitions. [2025-02-06 14:40:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-02-06 14:40:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1244 transitions. [2025-02-06 14:40:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 14:40:36,032 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:36,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-06 14:40:36,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 14:40:36,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-06 14:40:36,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:36,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1172237909, now seen corresponding path program 1 times [2025-02-06 14:40:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353282267] [2025-02-06 14:40:36,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:37,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 14:40:37,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 14:40:37,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:37,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 14:40:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353282267] [2025-02-06 14:40:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353282267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:40:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 14:40:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92039188] [2025-02-06 14:40:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:38,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:40:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:38,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:40:38,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:40:38,149 INFO L87 Difference]: Start difference. First operand 968 states and 1244 transitions. Second operand has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:40:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:38,365 INFO L93 Difference]: Finished difference Result 968 states and 1244 transitions. [2025-02-06 14:40:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:40:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 104 [2025-02-06 14:40:38,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:38,369 INFO L225 Difference]: With dead ends: 968 [2025-02-06 14:40:38,369 INFO L226 Difference]: Without dead ends: 967 [2025-02-06 14:40:38,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:40:38,369 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:38,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 439 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 14:40:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2025-02-06 14:40:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 959. [2025-02-06 14:40:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 767 states have (on average 1.2620599739243807) internal successors, (968), 767 states have internal predecessors, (968), 132 states have call successors, (132), 59 states have call predecessors, (132), 59 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 14:40:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1232 transitions. [2025-02-06 14:40:38,392 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1232 transitions. Word has length 104 [2025-02-06 14:40:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:38,392 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1232 transitions. [2025-02-06 14:40:38,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 14:40:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1232 transitions. [2025-02-06 14:40:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-06 14:40:38,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:38,395 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 14:40:38,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 14:40:38,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:38,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1512883697, now seen corresponding path program 1 times [2025-02-06 14:40:38,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:38,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107452227] [2025-02-06 14:40:38,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 14:40:38,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:40,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-06 14:40:40,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-06 14:40:40,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 14:40:40,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-02-06 14:40:40,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:40,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107452227] [2025-02-06 14:40:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107452227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:40:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 14:40:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502851353] [2025-02-06 14:40:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:40,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 14:40:40,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:40,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 14:40:40,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 14:40:40,265 INFO L87 Difference]: Start difference. First operand 959 states and 1232 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:40:44,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 14:40:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 14:40:44,887 INFO L93 Difference]: Finished difference Result 1809 states and 2324 transitions. [2025-02-06 14:40:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 14:40:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 170 [2025-02-06 14:40:44,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 14:40:44,891 INFO L225 Difference]: With dead ends: 1809 [2025-02-06 14:40:44,891 INFO L226 Difference]: Without dead ends: 959 [2025-02-06 14:40:44,897 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-06 14:40:44,897 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 159 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-06 14:40:44,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 562 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-02-06 14:40:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-06 14:40:44,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2025-02-06 14:40:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 767 states have (on average 1.256844850065189) internal successors, (964), 767 states have internal predecessors, (964), 132 states have call successors, (132), 59 states have call predecessors, (132), 59 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-02-06 14:40:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1228 transitions. [2025-02-06 14:40:44,952 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1228 transitions. Word has length 170 [2025-02-06 14:40:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 14:40:44,954 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1228 transitions. [2025-02-06 14:40:44,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 14:40:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1228 transitions. [2025-02-06 14:40:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 14:40:44,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 14:40:44,960 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-02-06 14:40:44,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 14:40:44,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-02-06 14:40:44,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 14:40:44,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2071046063, now seen corresponding path program 2 times [2025-02-06 14:40:44,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 14:40:44,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673202496] [2025-02-06 14:40:44,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 14:40:44,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 14:40:46,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-02-06 14:40:47,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 192 statements. [2025-02-06 14:40:47,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 14:40:47,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 14:40:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-02-06 14:40:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 14:40:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673202496] [2025-02-06 14:40:49,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673202496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 14:40:49,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 14:40:49,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 14:40:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696713468] [2025-02-06 14:40:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 14:40:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 14:40:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 14:40:49,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 14:40:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 14:40:49,624 INFO L87 Difference]: Start difference. First operand 959 states and 1228 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)