./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-8fc3dc6-m [2025-03-17 15:51:44,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:51:44,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 15:51:44,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:51:44,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:51:44,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:51:44,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:51:44,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:51:44,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:51:44,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:51:44,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:51:44,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:51:44,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:51:44,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:51:44,938 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:51:44,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:51:44,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:51:44,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:51:44,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:51:44,939 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:51:44,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:51:44,940 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/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-03-17 15:51:45,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:51:45,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:51:45,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:51:45,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:51:45,163 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:51:45,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-17 15:51:46,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0472243/a110875e122041a9b0954ce1ef9b8fc8/FLAG811adb780 [2025-03-17 15:51:46,596 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:51:46,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-17 15:51:46,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0472243/a110875e122041a9b0954ce1ef9b8fc8/FLAG811adb780 [2025-03-17 15:51:46,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0472243/a110875e122041a9b0954ce1ef9b8fc8 [2025-03-17 15:51:46,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:51:46,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:51:46,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:51:46,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:51:46,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:51:46,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:46" (1/1) ... [2025-03-17 15:51:46,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ffc3f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:46, skipping insertion in model container [2025-03-17 15:51:46,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:51:46" (1/1) ... [2025-03-17 15:51:46,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:51:47,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:51:47,250 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:51:47,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:51:47,398 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:51:47,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47 WrapperNode [2025-03-17 15:51:47,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:51:47,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:51:47,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:51:47,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:51:47,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,449 INFO L138 Inliner]: procedures = 100, calls = 349, calls flagged for inlining = 41, calls inlined = 33, statements flattened = 817 [2025-03-17 15:51:47,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:51:47,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:51:47,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:51:47,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:51:47,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,466 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,518 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 14, 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, 12, 2, 65, 93, 32]. [2025-03-17 15:51:47,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:51:47,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:51:47,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:51:47,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:51:47,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (1/1) ... [2025-03-17 15:51:47,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:51:47,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:51:47,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 15:51:47,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-03-17 15:51:47,615 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 15:51:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 15:51:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-17 15:51:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 15:51:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 15:51:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-03-17 15:51:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-17 15:51:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-03-17 15:51:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-17 15:51:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 15:51:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:51:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-17 15:51:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:51:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:51:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-17 15:51:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-17 15:51:47,814 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:51:47,816 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:51:47,858 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet118; [2025-03-17 15:51:47,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret117.base, #t~ret117.offset; [2025-03-17 15:51:47,904 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet105; [2025-03-17 15:51:52,919 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret110#1.base, dev_get_drvdata_#t~ret110#1.offset; [2025-03-17 15:51:52,920 INFO L1322 $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-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet114#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet119#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet111#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret120#1.base, regulator_register_#t~ret120#1.offset; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet115#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet113#1; [2025-03-17 15:51:52,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret112#1.base, devm_kzalloc_#t~ret112#1.offset; [2025-03-17 15:51:52,986 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2025-03-17 15:51:52,986 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:51:53,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:51:53,003 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:51:53,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:53 BoogieIcfgContainer [2025-03-17 15:51:53,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:51:53,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:51:53,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:51:53,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:51:53,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:51:46" (1/3) ... [2025-03-17 15:51:53,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b9385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:53, skipping insertion in model container [2025-03-17 15:51:53,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:51:47" (2/3) ... [2025-03-17 15:51:53,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556b9385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:51:53, skipping insertion in model container [2025-03-17 15:51:53,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:51:53" (3/3) ... [2025-03-17 15:51:53,010 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-17 15:51:53,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:51:53,024 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, 184 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-17 15:51:53,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:51:53,073 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;@5bea8162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:51:53,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 15:51:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 133 states have (on average 1.481203007518797) internal successors, (197), 150 states have internal predecessors, (197), 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-03-17 15:51:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 15:51:53,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:53,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:51:53,081 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-03-17 15:51:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1618095560, now seen corresponding path program 1 times [2025-03-17 15:51:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054156005] [2025-03-17 15:51:53,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:55,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 15:51:55,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 15:51:55,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:55,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:51:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054156005] [2025-03-17 15:51:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054156005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:51:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:51:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561863135] [2025-03-17 15:51:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:55,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:51:55,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:55,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:51:55,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:51:55,807 INFO L87 Difference]: Start difference. First operand has 184 states, 133 states have (on average 1.481203007518797) internal successors, (197), 150 states have internal predecessors, (197), 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 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-03-17 15:51:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:55,965 INFO L93 Difference]: Finished difference Result 479 states and 690 transitions. [2025-03-17 15:51:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:51:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2025-03-17 15:51:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:55,973 INFO L225 Difference]: With dead ends: 479 [2025-03-17 15:51:55,974 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 15:51:55,976 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-03-17 15:51:55,980 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 153 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:55,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 494 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:51:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 15:51:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-17 15:51:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 196 states have (on average 1.4183673469387754) internal successors, (278), 206 states have internal predecessors, (278), 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-03-17 15:51:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2025-03-17 15:51:56,045 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 13 [2025-03-17 15:51:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:56,045 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2025-03-17 15:51:56,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 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-03-17 15:51:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2025-03-17 15:51:56,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 15:51:56,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:56,047 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] [2025-03-17 15:51:56,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:51:56,047 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-03-17 15:51:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash -83939449, now seen corresponding path program 1 times [2025-03-17 15:51:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:56,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422640296] [2025-03-17 15:51:56,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:51:57,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 15:51:57,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 15:51:57,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:51:57,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:51:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 15:51:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:51:58,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422640296] [2025-03-17 15:51:58,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422640296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:51:58,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:51:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:51:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453622769] [2025-03-17 15:51:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:51:58,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:51:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:51:58,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:51:58,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:51:58,309 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-03-17 15:51:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:51:58,497 INFO L93 Difference]: Finished difference Result 527 states and 711 transitions. [2025-03-17 15:51:58,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:51:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 23 [2025-03-17 15:51:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:51:58,501 INFO L225 Difference]: With dead ends: 527 [2025-03-17 15:51:58,502 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 15:51:58,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-17 15:51:58,503 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 195 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:51:58,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 427 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:51:58,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 15:51:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 517. [2025-03-17 15:51:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 391 states have (on average 1.4092071611253196) internal successors, (551), 402 states have internal predecessors, (551), 78 states have call successors, (78), 38 states have call predecessors, (78), 38 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 15:51:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 707 transitions. [2025-03-17 15:51:58,535 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 707 transitions. Word has length 23 [2025-03-17 15:51:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:51:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 707 transitions. [2025-03-17 15:51:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-03-17 15:51:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 707 transitions. [2025-03-17 15:51:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:51:58,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:51:58,537 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] [2025-03-17 15:51:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:51:58,537 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-03-17 15:51:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:51:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 667801160, now seen corresponding path program 1 times [2025-03-17 15:51:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:51:58,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328238683] [2025-03-17 15:51:58,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:51:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:00,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:52:00,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:52:00,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:52:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328238683] [2025-03-17 15:52:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328238683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:52:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503185389] [2025-03-17 15:52:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:00,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:00,635 INFO L87 Difference]: Start difference. First operand 517 states and 707 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-17 15:52:04,668 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-03-17 15:52:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:05,217 INFO L93 Difference]: Finished difference Result 1129 states and 1544 transitions. [2025-03-17 15:52:05,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:05,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 31 [2025-03-17 15:52:05,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:05,222 INFO L225 Difference]: With dead ends: 1129 [2025-03-17 15:52:05,222 INFO L226 Difference]: Without dead ends: 613 [2025-03-17 15:52:05,224 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-03-17 15:52:05,225 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 192 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:05,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 15:52:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-17 15:52:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2025-03-17 15:52:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 463 states have (on average 1.3995680345572354) internal successors, (648), 474 states have internal predecessors, (648), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 15:52:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 832 transitions. [2025-03-17 15:52:05,248 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 832 transitions. Word has length 31 [2025-03-17 15:52:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:05,248 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 832 transitions. [2025-03-17 15:52:05,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-03-17 15:52:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 832 transitions. [2025-03-17 15:52:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 15:52:05,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:05,250 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:52:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:52:05,250 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-03-17 15:52:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1130001156, now seen corresponding path program 1 times [2025-03-17 15:52:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436182614] [2025-03-17 15:52:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:07,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 15:52:07,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 15:52:07,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:07,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:07,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 15:52:07,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:07,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436182614] [2025-03-17 15:52:07,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436182614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:07,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:07,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:52:07,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586676316] [2025-03-17 15:52:07,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:07,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:07,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:07,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:07,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:52:07,495 INFO L87 Difference]: Start difference. First operand 613 states and 832 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 15:52:11,526 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-03-17 15:52:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:12,282 INFO L93 Difference]: Finished difference Result 1275 states and 1729 transitions. [2025-03-17 15:52:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:52:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 36 [2025-03-17 15:52:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:12,289 INFO L225 Difference]: With dead ends: 1275 [2025-03-17 15:52:12,289 INFO L226 Difference]: Without dead ends: 903 [2025-03-17 15:52:12,291 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-03-17 15:52:12,291 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 194 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1029 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-03-17 15:52:12,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1029 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 15:52:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-03-17 15:52:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 617. [2025-03-17 15:52:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 467 states have (on average 1.3961456102783727) internal successors, (652), 478 states have internal predecessors, (652), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 15:52:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 836 transitions. [2025-03-17 15:52:12,331 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 836 transitions. Word has length 36 [2025-03-17 15:52:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:12,332 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 836 transitions. [2025-03-17 15:52:12,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-03-17 15:52:12,334 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 836 transitions. [2025-03-17 15:52:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 15:52:12,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:12,337 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] [2025-03-17 15:52:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:52:12,337 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-03-17 15:52:12,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 782512862, now seen corresponding path program 1 times [2025-03-17 15:52:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:12,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174617866] [2025-03-17 15:52:12,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:12,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:14,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 15:52:14,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 15:52:14,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:14,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:52:14,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174617866] [2025-03-17 15:52:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174617866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:14,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:14,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:14,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762269647] [2025-03-17 15:52:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:14,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:14,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:14,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:14,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:14,593 INFO L87 Difference]: Start difference. First operand 617 states and 836 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-17 15:52:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:14,993 INFO L93 Difference]: Finished difference Result 1166 states and 1589 transitions. [2025-03-17 15:52:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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 46 [2025-03-17 15:52:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:14,997 INFO L225 Difference]: With dead ends: 1166 [2025-03-17 15:52:14,997 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 15:52:14,998 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-03-17 15:52:14,998 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 4 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 412 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-03-17 15:52:15,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 412 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:52:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 15:52:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-17 15:52:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 493 states have (on average 1.3793103448275863) internal successors, (680), 504 states have internal predecessors, (680), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 15:52:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 876 transitions. [2025-03-17 15:52:15,023 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 876 transitions. Word has length 46 [2025-03-17 15:52:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 876 transitions. [2025-03-17 15:52:15,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 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-03-17 15:52:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 876 transitions. [2025-03-17 15:52:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 15:52:15,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:15,025 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] [2025-03-17 15:52:15,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:52:15,025 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-03-17 15:52:15,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash 132758294, now seen corresponding path program 1 times [2025-03-17 15:52:15,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:15,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322571312] [2025-03-17 15:52:15,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:16,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 15:52:16,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 15:52:16,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:16,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 15:52:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:17,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322571312] [2025-03-17 15:52:17,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322571312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:17,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:17,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:52:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503873821] [2025-03-17 15:52:17,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:17,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:17,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:17,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:52:17,103 INFO L87 Difference]: Start difference. First operand 649 states and 876 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 15:52:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:17,764 INFO L93 Difference]: Finished difference Result 1200 states and 1621 transitions. [2025-03-17 15:52:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:17,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 59 [2025-03-17 15:52:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:17,768 INFO L225 Difference]: With dead ends: 1200 [2025-03-17 15:52:17,768 INFO L226 Difference]: Without dead ends: 651 [2025-03-17 15:52:17,770 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-03-17 15:52:17,771 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 2 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 608 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:17,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 608 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:52:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-17 15:52:17,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2025-03-17 15:52:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 495 states have (on average 1.3777777777777778) internal successors, (682), 506 states have internal predecessors, (682), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 15:52:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 878 transitions. [2025-03-17 15:52:17,797 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 878 transitions. Word has length 59 [2025-03-17 15:52:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:17,798 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 878 transitions. [2025-03-17 15:52:17,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-03-17 15:52:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 878 transitions. [2025-03-17 15:52:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:52:17,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:17,800 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-17 15:52:17,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:52:17,801 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-03-17 15:52:17,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:17,802 INFO L85 PathProgramCache]: Analyzing trace with hash 293693894, now seen corresponding path program 1 times [2025-03-17 15:52:17,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:17,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773397116] [2025-03-17 15:52:17,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:17,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:19,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:52:19,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:52:19,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:19,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 15:52:20,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773397116] [2025-03-17 15:52:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773397116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648237756] [2025-03-17 15:52:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:20,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:20,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:20,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 15:52:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:52:22,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:52:22,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:22,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:22,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 2380 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:22,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-17 15:52:22,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:22,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648237756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:22,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:22,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 15:52:22,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15833375] [2025-03-17 15:52:22,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:22,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:22,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:22,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:22,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:22,913 INFO L87 Difference]: Start difference. First operand 651 states and 878 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-03-17 15:52:23,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:23,544 INFO L93 Difference]: Finished difference Result 1206 states and 1633 transitions. [2025-03-17 15:52:23,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:23,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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 65 [2025-03-17 15:52:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:23,548 INFO L225 Difference]: With dead ends: 1206 [2025-03-17 15:52:23,548 INFO L226 Difference]: Without dead ends: 655 [2025-03-17 15:52:23,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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-03-17 15:52:23,553 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 9 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 608 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:23,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 608 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:52:23,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-03-17 15:52:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2025-03-17 15:52:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 501 states have (on average 1.3652694610778444) internal successors, (684), 508 states have internal predecessors, (684), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 15:52:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 880 transitions. [2025-03-17 15:52:23,574 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 880 transitions. Word has length 65 [2025-03-17 15:52:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 880 transitions. [2025-03-17 15:52:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-03-17 15:52:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 880 transitions. [2025-03-17 15:52:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 15:52:23,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:23,578 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] [2025-03-17 15:52:23,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:23,779 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-03-17 15:52:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash 514576357, now seen corresponding path program 1 times [2025-03-17 15:52:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:23,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707720164] [2025-03-17 15:52:23,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:25,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 15:52:25,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 15:52:25,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:25,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 15:52:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707720164] [2025-03-17 15:52:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707720164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:52:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:52:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933211719] [2025-03-17 15:52:25,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:25,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:25,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:25,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:25,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:52:25,745 INFO L87 Difference]: Start difference. First operand 655 states and 880 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-03-17 15:52:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:26,021 INFO L93 Difference]: Finished difference Result 655 states and 880 transitions. [2025-03-17 15:52:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 66 [2025-03-17 15:52:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:26,025 INFO L225 Difference]: With dead ends: 655 [2025-03-17 15:52:26,025 INFO L226 Difference]: Without dead ends: 653 [2025-03-17 15:52:26,026 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-03-17 15:52:26,026 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 6 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 395 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:26,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 395 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:52:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-17 15:52:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2025-03-17 15:52:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 497 states have (on average 1.3561368209255533) internal successors, (674), 502 states have internal predecessors, (674), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 15:52:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 870 transitions. [2025-03-17 15:52:26,046 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 870 transitions. Word has length 66 [2025-03-17 15:52:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:26,047 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 870 transitions. [2025-03-17 15:52:26,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-03-17 15:52:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 870 transitions. [2025-03-17 15:52:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-17 15:52:26,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:26,049 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] [2025-03-17 15:52:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:52:26,049 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-03-17 15:52:26,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -527706993, now seen corresponding path program 1 times [2025-03-17 15:52:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481056485] [2025-03-17 15:52:26,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:27,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 15:52:27,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:52:27,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:27,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:52:28,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481056485] [2025-03-17 15:52:28,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481056485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:28,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931095542] [2025-03-17 15:52:28,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:28,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:28,133 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:28,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 15:52:30,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 15:52:30,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 15:52:30,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:30,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 2399 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:52:30,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:52:30,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:30,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931095542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:30,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:30,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 15:52:30,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241310199] [2025-03-17 15:52:30,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:30,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:30,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:30,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:30,814 INFO L87 Difference]: Start difference. First operand 649 states and 870 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-17 15:52:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:30,991 INFO L93 Difference]: Finished difference Result 1040 states and 1397 transitions. [2025-03-17 15:52:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:30,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 70 [2025-03-17 15:52:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:30,994 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 15:52:30,994 INFO L226 Difference]: Without dead ends: 654 [2025-03-17 15:52:30,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-03-17 15:52:30,996 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 419 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-03-17 15:52:30,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 419 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:52:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-17 15:52:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-03-17 15:52:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 501 states have (on average 1.3552894211576847) internal successors, (679), 506 states have internal predecessors, (679), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 15:52:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 877 transitions. [2025-03-17 15:52:31,012 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 877 transitions. Word has length 70 [2025-03-17 15:52:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 877 transitions. [2025-03-17 15:52:31,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-17 15:52:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 877 transitions. [2025-03-17 15:52:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 15:52:31,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:31,014 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] [2025-03-17 15:52:31,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 15:52:31,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 15:52:31,215 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-03-17 15:52:31,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 996834957, now seen corresponding path program 1 times [2025-03-17 15:52:31,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553549579] [2025-03-17 15:52:31,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:32,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:52:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:52:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 15:52:33,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553549579] [2025-03-17 15:52:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553549579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:33,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161811216] [2025-03-17 15:52:33,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:33,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:33,222 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:33,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 15:52:35,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 15:52:35,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 15:52:35,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:35,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:35,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 2409 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 15:52:35,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:35,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 15:52:35,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161811216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 15:52:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247206401] [2025-03-17 15:52:35,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:52:35,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:35,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:52:35,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:52:35,861 INFO L87 Difference]: Start difference. First operand 654 states and 877 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-03-17 15:52:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:35,996 INFO L93 Difference]: Finished difference Result 654 states and 877 transitions. [2025-03-17 15:52:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:52:35,996 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-03-17 15:52:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:35,999 INFO L225 Difference]: With dead ends: 654 [2025-03-17 15:52:35,999 INFO L226 Difference]: Without dead ends: 653 [2025-03-17 15:52:35,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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-03-17 15:52:36,000 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 416 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:36,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 416 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:52:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-03-17 15:52:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-03-17 15:52:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 501 states have (on average 1.3512974051896207) internal successors, (677), 505 states have internal predecessors, (677), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-17 15:52:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 875 transitions. [2025-03-17 15:52:36,015 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 875 transitions. Word has length 74 [2025-03-17 15:52:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 875 transitions. [2025-03-17 15:52:36,015 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-03-17 15:52:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 875 transitions. [2025-03-17 15:52:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 15:52:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:36,017 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] [2025-03-17 15:52:36,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:36,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:36,223 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-03-17 15:52:36,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1846921770, now seen corresponding path program 1 times [2025-03-17 15:52:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561399582] [2025-03-17 15:52:36,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:36,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:37,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:52:37,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:52:37,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:37,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:52:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561399582] [2025-03-17 15:52:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561399582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168051736] [2025-03-17 15:52:38,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:38,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:38,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:38,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:38,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 15:52:40,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 15:52:40,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 15:52:40,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:40,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:40,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 2420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:40,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:52:41,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:52:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:52:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168051736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:52:41,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:52:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 15:52:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875955718] [2025-03-17 15:52:41,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:52:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:52:41,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:41,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:52:41,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:52:41,654 INFO L87 Difference]: Start difference. First operand 653 states and 875 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-03-17 15:52:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:42,333 INFO L93 Difference]: Finished difference Result 1254 states and 1677 transitions. [2025-03-17 15:52:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:52:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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 78 [2025-03-17 15:52:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:42,336 INFO L225 Difference]: With dead ends: 1254 [2025-03-17 15:52:42,336 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 15:52:42,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 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-03-17 15:52:42,337 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 33 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:42,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 408 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:52:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 15:52:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 683. [2025-03-17 15:52:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 527 states have (on average 1.3377609108159392) internal successors, (705), 531 states have internal predecessors, (705), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-17 15:52:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 911 transitions. [2025-03-17 15:52:42,354 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 911 transitions. Word has length 78 [2025-03-17 15:52:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:42,354 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 911 transitions. [2025-03-17 15:52:42,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-03-17 15:52:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 911 transitions. [2025-03-17 15:52:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 15:52:42,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:42,356 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] [2025-03-17 15:52:42,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:42,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:42,557 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-03-17 15:52:42,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash 161329836, now seen corresponding path program 1 times [2025-03-17 15:52:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:42,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321761096] [2025-03-17 15:52:42,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:44,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 15:52:44,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 15:52:44,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:44,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 15:52:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321761096] [2025-03-17 15:52:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321761096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731164343] [2025-03-17 15:52:44,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:44,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:44,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:44,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:44,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 15:52:47,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 15:52:47,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 15:52:47,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:47,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:47,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 2416 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:47,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:52:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:52:49,071 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:52:49,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731164343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:52:49,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:52:49,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-03-17 15:52:49,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695488045] [2025-03-17 15:52:49,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:52:49,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:52:49,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:52:49,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:52:49,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:52:49,072 INFO L87 Difference]: Start difference. First operand 683 states and 911 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-17 15:52:53,101 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-03-17 15:52:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:52:54,234 INFO L93 Difference]: Finished difference Result 861 states and 1148 transitions. [2025-03-17 15:52:54,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:52:54,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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 82 [2025-03-17 15:52:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:52:54,239 INFO L225 Difference]: With dead ends: 861 [2025-03-17 15:52:54,239 INFO L226 Difference]: Without dead ends: 859 [2025-03-17 15:52:54,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:52:54,240 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 337 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:52:54,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 545 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 15:52:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-17 15:52:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 681. [2025-03-17 15:52:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 527 states have (on average 1.333965844402277) internal successors, (703), 529 states have internal predecessors, (703), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-17 15:52:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 909 transitions. [2025-03-17 15:52:54,264 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 909 transitions. Word has length 82 [2025-03-17 15:52:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:52:54,264 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 909 transitions. [2025-03-17 15:52:54,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-03-17 15:52:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 909 transitions. [2025-03-17 15:52:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 15:52:54,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:52:54,266 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-03-17 15:52:54,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 15:52:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-17 15:52:54,467 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-03-17 15:52:54,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:52:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash 706257797, now seen corresponding path program 1 times [2025-03-17 15:52:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:52:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34151110] [2025-03-17 15:52:54,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:52:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 15:52:56,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:52:56,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:56,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-17 15:52:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:52:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34151110] [2025-03-17 15:52:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34151110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:52:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861006219] [2025-03-17 15:52:56,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:52:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:52:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:52:56,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:52:56,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 15:52:58,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 15:52:59,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 15:52:59,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:52:59,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:52:59,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 2417 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:52:59,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:53:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 15:53:01,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:53:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 15:53:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861006219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:53:02,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:53:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 2, 3] total 8 [2025-03-17 15:53:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801055296] [2025-03-17 15:53:02,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:53:02,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:53:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:53:02,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:53:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:53:02,991 INFO L87 Difference]: Start difference. First operand 681 states and 909 transitions. Second operand has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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-03-17 15:53:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:53:05,555 INFO L93 Difference]: Finished difference Result 1672 states and 2239 transitions. [2025-03-17 15:53:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 15:53:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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 83 [2025-03-17 15:53:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:53:05,560 INFO L225 Difference]: With dead ends: 1672 [2025-03-17 15:53:05,560 INFO L226 Difference]: Without dead ends: 1269 [2025-03-17 15:53:05,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-17 15:53:05,562 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 728 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:53:05,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 915 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 15:53:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-17 15:53:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1090. [2025-03-17 15:53:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 845 states have (on average 1.331360946745562) internal successors, (1125), 846 states have internal predecessors, (1125), 166 states have call successors, (166), 77 states have call predecessors, (166), 77 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-17 15:53:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1457 transitions. [2025-03-17 15:53:05,594 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1457 transitions. Word has length 83 [2025-03-17 15:53:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:53:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 1090 states and 1457 transitions. [2025-03-17 15:53:05,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.875) internal successors, (183), 8 states have internal predecessors, (183), 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-03-17 15:53:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1457 transitions. [2025-03-17 15:53:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 15:53:05,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:53:05,596 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] [2025-03-17 15:53:05,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 15:53:05,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:53:05,797 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-03-17 15:53:05,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:53:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1823317995, now seen corresponding path program 1 times [2025-03-17 15:53:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:53:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395469228] [2025-03-17 15:53:05,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:53:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:53:07,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 15:53:07,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 15:53:07,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:53:07,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:53:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:53:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:53:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395469228] [2025-03-17 15:53:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395469228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:53:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:53:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:53:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500764676] [2025-03-17 15:53:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:53:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:53:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:53:07,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:53:07,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:53:07,667 INFO L87 Difference]: Start difference. First operand 1090 states and 1457 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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-03-17 15:53:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:53:07,796 INFO L93 Difference]: Finished difference Result 1090 states and 1457 transitions. [2025-03-17 15:53:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:53:07,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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 95 [2025-03-17 15:53:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:53:07,801 INFO L225 Difference]: With dead ends: 1090 [2025-03-17 15:53:07,801 INFO L226 Difference]: Without dead ends: 1089 [2025-03-17 15:53:07,801 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-03-17 15:53:07,802 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 411 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:53:07,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 411 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:53:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-17 15:53:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1081. [2025-03-17 15:53:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 839 states have (on average 1.33134684147795) internal successors, (1117), 839 states have internal predecessors, (1117), 164 states have call successors, (164), 77 states have call predecessors, (164), 77 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-17 15:53:07,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1445 transitions. [2025-03-17 15:53:07,834 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1445 transitions. Word has length 95 [2025-03-17 15:53:07,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:53:07,835 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1445 transitions. [2025-03-17 15:53:07,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 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-03-17 15:53:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1445 transitions. [2025-03-17 15:53:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 15:53:07,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:53:07,838 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:53:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:53:07,838 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-03-17 15:53:07,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:53:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash -189907112, now seen corresponding path program 1 times [2025-03-17 15:53:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:53:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727369124] [2025-03-17 15:53:07,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:53:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:53:09,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 15:53:09,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 15:53:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:53:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:53:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 15:53:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:53:09,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727369124] [2025-03-17 15:53:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727369124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:53:09,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:53:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:53:09,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51421096] [2025-03-17 15:53:09,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:53:09,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:53:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:53:09,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:53:09,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:53:09,843 INFO L87 Difference]: Start difference. First operand 1081 states and 1445 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-03-17 15:53:13,868 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-03-17 15:53:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:53:14,468 INFO L93 Difference]: Finished difference Result 1864 states and 2487 transitions. [2025-03-17 15:53:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:53:14,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 152 [2025-03-17 15:53:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:53:14,471 INFO L225 Difference]: With dead ends: 1864 [2025-03-17 15:53:14,471 INFO L226 Difference]: Without dead ends: 883 [2025-03-17 15:53:14,473 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-03-17 15:53:14,473 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 151 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:53:14,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 537 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 15:53:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-17 15:53:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-17 15:53:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 691 states have (on average 1.312590448625181) internal successors, (907), 691 states have internal predecessors, (907), 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-03-17 15:53:14,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1171 transitions. [2025-03-17 15:53:14,501 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1171 transitions. Word has length 152 [2025-03-17 15:53:14,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:53:14,501 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1171 transitions. [2025-03-17 15:53:14,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-03-17 15:53:14,501 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1171 transitions. [2025-03-17 15:53:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 15:53:14,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:53:14,505 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, 2, 1, 1] [2025-03-17 15:53:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 15:53:14,506 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-03-17 15:53:14,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:53:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -643619912, now seen corresponding path program 2 times [2025-03-17 15:53:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:53:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413653572] [2025-03-17 15:53:14,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:53:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:53:16,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-03-17 15:53:16,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 172 statements. [2025-03-17 15:53:16,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 15:53:16,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:53:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-17 15:53:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:53:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413653572] [2025-03-17 15:53:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413653572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:53:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:53:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:53:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149016910] [2025-03-17 15:53:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:53:17,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:53:17,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:53:17,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:53:17,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:53:17,225 INFO L87 Difference]: Start difference. First operand 883 states and 1171 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-03-17 15:53:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:53:17,863 INFO L93 Difference]: Finished difference Result 1675 states and 2219 transitions. [2025-03-17 15:53:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:53:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 172 [2025-03-17 15:53:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:53:17,866 INFO L225 Difference]: With dead ends: 1675 [2025-03-17 15:53:17,866 INFO L226 Difference]: Without dead ends: 892 [2025-03-17 15:53:17,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:53:17,869 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 5 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:53:17,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1019 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 15:53:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2025-03-17 15:53:17,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2025-03-17 15:53:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 700 states have (on average 1.3085714285714285) internal successors, (916), 700 states have internal predecessors, (916), 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-03-17 15:53:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1180 transitions. [2025-03-17 15:53:17,896 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1180 transitions. Word has length 172 [2025-03-17 15:53:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:53:17,896 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1180 transitions. [2025-03-17 15:53:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-03-17 15:53:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1180 transitions. [2025-03-17 15:53:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-17 15:53:17,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:53:17,899 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, 2, 1, 1] [2025-03-17 15:53:17,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 15:53:17,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-17 15:53:17,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:53:17,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2102558261, now seen corresponding path program 1 times [2025-03-17 15:53:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:53:17,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828138666] [2025-03-17 15:53:17,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:53:17,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:53:19,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-17 15:53:19,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-17 15:53:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:53:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:53:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-03-17 15:53:19,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:53:19,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828138666] [2025-03-17 15:53:19,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828138666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:53:19,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:53:19,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:53:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540163776] [2025-03-17 15:53:19,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:53:19,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:53:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:53:19,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:53:19,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:53:19,906 INFO L87 Difference]: Start difference. First operand 892 states and 1180 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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)