./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-2.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/busybox-1.22.0/du-2.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 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:54:14,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:54:14,391 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:54:14,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:54:14,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:54:14,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:54:14,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:54:14,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:54:14,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:54:14,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:54:14,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:54:14,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:54:14,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:54:14,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:54:14,422 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:54:14,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:54:14,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:54:14,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:54:14,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:54:14,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:54:14,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:54:14,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:54:14,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:54:14,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:54:14,425 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 -> 346a1df1af8d017aad802aadc8d149a7a67e764b593bc1f05b05c788fbe74a6f [2025-03-17 18:54:14,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:54:14,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:54:14,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:54:14,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:54:14,661 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:54:14,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-03-17 18:54:15,791 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045bb4e52/91552bbd29084e55aa487a9e0d9bd974/FLAG43bdcbd7d [2025-03-17 18:54:16,199 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:54:16,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-2.i [2025-03-17 18:54:16,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045bb4e52/91552bbd29084e55aa487a9e0d9bd974/FLAG43bdcbd7d [2025-03-17 18:54:16,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/045bb4e52/91552bbd29084e55aa487a9e0d9bd974 [2025-03-17 18:54:16,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:54:16,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:54:16,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:54:16,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:54:16,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:54:16,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:54:16" (1/1) ... [2025-03-17 18:54:16,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a56497b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:16, skipping insertion in model container [2025-03-17 18:54:16,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:54:16" (1/1) ... [2025-03-17 18:54:16,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:54:17,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:54:17,233 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:54:17,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:54:17,648 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:54:17,657 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:54:17,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17 WrapperNode [2025-03-17 18:54:17,658 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:54:17,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:54:17,659 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:54:17,659 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:54:17,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:17,793 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,101 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11043 [2025-03-17 18:54:18,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:54:18,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:54:18,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:54:18,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:54:18,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,186 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:54:18,187 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:54:18,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:54:18,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:54:18,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:54:18,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (1/1) ... [2025-03-17 18:54:18,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:54:18,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:54:18,506 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 18:54:18,572 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 18:54:18,592 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-17 18:54:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-03-17 18:54:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-03-17 18:54:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-03-17 18:54:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 18:54:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 18:54:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-17 18:54:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-17 18:54:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 18:54:18,990 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:54:18,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:54:19,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3682: havoc lstat_#t~ret345#1; [2025-03-17 18:54:19,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2774: call ULTIMATE.dealloc(~#statbuf~0#1.base, ~#statbuf~0#1.offset);havoc ~#statbuf~0#1.base, ~#statbuf~0#1.offset; [2025-03-17 18:54:19,328 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3494: havoc xasprintf_#t~mem282#1.base, xasprintf_#t~mem282#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-17 18:54:19,519 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3678: havoc #t~ret344#1; [2025-03-17 18:54:39,742 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2912: havoc __main_#t~mem136#1; [2025-03-17 18:54:39,743 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2956: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-17 18:54:39,743 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc getopt_long_#t~ret373#1; [2025-03-17 18:54:39,931 INFO L? ?]: Removed 717 outVars from TransFormulas that were not future-live. [2025-03-17 18:54:39,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:54:39,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:54:39,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:54:39,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:54:39 BoogieIcfgContainer [2025-03-17 18:54:39,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:54:39,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:54:39,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:54:39,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:54:39,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:54:16" (1/3) ... [2025-03-17 18:54:39,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5061f35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:54:39, skipping insertion in model container [2025-03-17 18:54:39,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:54:17" (2/3) ... [2025-03-17 18:54:39,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5061f35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:54:39, skipping insertion in model container [2025-03-17 18:54:39,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:54:39" (3/3) ... [2025-03-17 18:54:39,981 INFO L128 eAbstractionObserver]: Analyzing ICFG du-2.i [2025-03-17 18:54:39,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:54:39,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-2.i that has 14 procedures, 678 locations, 1 initial locations, 39 loop locations, and 77 error locations. [2025-03-17 18:54:40,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:54:40,062 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;@301c9415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:54:40,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-03-17 18:54:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 678 states, 546 states have (on average 1.6611721611721613) internal successors, (907), 629 states have internal predecessors, (907), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-17 18:54:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:54:40,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:54:40,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:54:40,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:54:40,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:54:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1143904, now seen corresponding path program 1 times [2025-03-17 18:54:40,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:54:40,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218589299] [2025-03-17 18:54:40,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:54:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:54:42,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:54:42,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:54:42,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:54:42,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:54:44,407 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 18:54:44,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:54:44,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218589299] [2025-03-17 18:54:44,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218589299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:54:44,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:54:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:54:44,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174518467] [2025-03-17 18:54:44,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:54:44,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:54:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:54:44,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:54:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:54:44,431 INFO L87 Difference]: Start difference. First operand has 678 states, 546 states have (on average 1.6611721611721613) internal successors, (907), 629 states have internal predecessors, (907), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 18:54:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:54:44,689 INFO L93 Difference]: Finished difference Result 1245 states and 1871 transitions. [2025-03-17 18:54:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:54:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-03-17 18:54:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:54:44,700 INFO L225 Difference]: With dead ends: 1245 [2025-03-17 18:54:44,700 INFO L226 Difference]: Without dead ends: 570 [2025-03-17 18:54:44,706 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 18:54:44,708 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:54:44,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1558 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 18:54:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-17 18:54:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2025-03-17 18:54:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 475 states have (on average 1.583157894736842) internal successors, (752), 530 states have internal predecessors, (752), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:54:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 817 transitions. [2025-03-17 18:54:44,783 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 817 transitions. Word has length 3 [2025-03-17 18:54:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:54:44,783 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 817 transitions. [2025-03-17 18:54:44,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 18:54:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 817 transitions. [2025-03-17 18:54:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 18:54:44,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:54:44,784 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 18:54:44,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:54:44,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:54:44,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:54:44,785 INFO L85 PathProgramCache]: Analyzing trace with hash -280614787, now seen corresponding path program 1 times [2025-03-17 18:54:44,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:54:44,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943575769] [2025-03-17 18:54:44,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:54:44,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:54:46,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:54:47,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:54:47,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:54:47,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:54:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:54:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:54:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943575769] [2025-03-17 18:54:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943575769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:54:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626448234] [2025-03-17 18:54:48,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:54:48,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:54:48,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:54:48,011 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 18:54:48,012 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 18:54:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:54:52,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:54:52,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:54:52,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:54:52,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 18365 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:54:52,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:54:52,124 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 18:54:52,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:54:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626448234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:54:52,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:54:52,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 18:54:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487478853] [2025-03-17 18:54:52,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:54:52,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:54:52,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:54:52,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:54:52,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:54:52,126 INFO L87 Difference]: Start difference. First operand 570 states and 817 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:54:56,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:54:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:54:56,648 INFO L93 Difference]: Finished difference Result 570 states and 817 transitions. [2025-03-17 18:54:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:54:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-17 18:54:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:54:56,651 INFO L225 Difference]: With dead ends: 570 [2025-03-17 18:54:56,651 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 18:54:56,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:54:56,652 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-17 18:54:56,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1553 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 18:54:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 18:54:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-03-17 18:54:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 475 states have (on average 1.5810526315789473) internal successors, (751), 529 states have internal predecessors, (751), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:54:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 816 transitions. [2025-03-17 18:54:56,680 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 816 transitions. Word has length 6 [2025-03-17 18:54:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:54:56,680 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 816 transitions. [2025-03-17 18:54:56,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:54:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 816 transitions. [2025-03-17 18:54:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:54:56,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:54:56,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:54:56,730 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 18:54:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:54:56,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:54:56,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:54:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -109122718, now seen corresponding path program 1 times [2025-03-17 18:54:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:54:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202411763] [2025-03-17 18:54:56,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:54:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:54:59,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:54:59,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:54:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:54:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:54:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:54:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:54:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202411763] [2025-03-17 18:54:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202411763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:54:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:54:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:54:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827014073] [2025-03-17 18:54:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:54:59,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:54:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:54:59,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:54:59,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:54:59,933 INFO L87 Difference]: Start difference. First operand 569 states and 816 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 18:55:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:55:00,370 INFO L93 Difference]: Finished difference Result 569 states and 816 transitions. [2025-03-17 18:55:00,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:55:00,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-03-17 18:55:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:55:00,373 INFO L225 Difference]: With dead ends: 569 [2025-03-17 18:55:00,373 INFO L226 Difference]: Without dead ends: 568 [2025-03-17 18:55:00,373 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 18:55:00,374 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 0 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:55:00,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1554 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 18:55:00,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-17 18:55:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-03-17 18:55:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 473 states have (on average 1.5813953488372092) internal successors, (748), 526 states have internal predecessors, (748), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:55:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 813 transitions. [2025-03-17 18:55:00,388 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 813 transitions. Word has length 7 [2025-03-17 18:55:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:55:00,389 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 813 transitions. [2025-03-17 18:55:00,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 18:55:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 813 transitions. [2025-03-17 18:55:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 18:55:00,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:55:00,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:55:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:55:00,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:55:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:55:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1511848228, now seen corresponding path program 1 times [2025-03-17 18:55:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:55:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685110792] [2025-03-17 18:55:00,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:55:02,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:55:02,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:55:02,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:55:03,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:55:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685110792] [2025-03-17 18:55:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685110792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:55:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539055950] [2025-03-17 18:55:03,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:03,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:55:03,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:55:03,403 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 18:55:03,404 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 18:55:05,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:55:07,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:55:07,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:07,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:07,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 18382 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:55:07,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:55:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:55:07,516 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:55:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539055950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:55:07,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:55:07,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:55:07,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853676784] [2025-03-17 18:55:07,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:55:07,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:55:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:55:07,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:55:07,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:55:07,517 INFO L87 Difference]: Start difference. First operand 566 states and 813 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:11,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:55:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:55:11,970 INFO L93 Difference]: Finished difference Result 566 states and 813 transitions. [2025-03-17 18:55:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:55:11,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 18:55:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:55:11,974 INFO L225 Difference]: With dead ends: 566 [2025-03-17 18:55:11,974 INFO L226 Difference]: Without dead ends: 564 [2025-03-17 18:55:11,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:55:11,975 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 512 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:55:11,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1052 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 18:55:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-17 18:55:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-03-17 18:55:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 473 states have (on average 1.5771670190274842) internal successors, (746), 524 states have internal predecessors, (746), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:55:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 811 transitions. [2025-03-17 18:55:11,992 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 811 transitions. Word has length 11 [2025-03-17 18:55:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:55:11,993 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 811 transitions. [2025-03-17 18:55:11,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 811 transitions. [2025-03-17 18:55:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:55:11,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:55:11,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:55:12,036 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 18:55:12,194 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,SelfDestructingSolverStorable3 [2025-03-17 18:55:12,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:55:12,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:55:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash -377344107, now seen corresponding path program 1 times [2025-03-17 18:55:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:55:12,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694006739] [2025-03-17 18:55:12,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:55:14,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:55:14,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:55:14,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:14,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:55:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:55:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694006739] [2025-03-17 18:55:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694006739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:55:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119212196] [2025-03-17 18:55:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:55:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:55:15,307 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 18:55:15,308 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 18:55:17,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:55:19,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:55:19,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:19,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:19,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:55:19,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:55:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:55:19,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:55:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:55:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119212196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:55:19,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:55:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 18:55:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555623367] [2025-03-17 18:55:19,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:55:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:55:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:55:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:55:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:55:19,357 INFO L87 Difference]: Start difference. First operand 564 states and 811 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:55:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:55:19,569 INFO L93 Difference]: Finished difference Result 1132 states and 1628 transitions. [2025-03-17 18:55:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:55:19,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-03-17 18:55:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:55:19,572 INFO L225 Difference]: With dead ends: 1132 [2025-03-17 18:55:19,572 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 18:55:19,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:55:19,574 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 4 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:55:19,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2324 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 18:55:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 18:55:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2025-03-17 18:55:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 482 states have (on average 1.566390041493776) internal successors, (755), 533 states have internal predecessors, (755), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:55:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 820 transitions. [2025-03-17 18:55:19,586 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 820 transitions. Word has length 12 [2025-03-17 18:55:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:55:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 820 transitions. [2025-03-17 18:55:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:55:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 820 transitions. [2025-03-17 18:55:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:55:19,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:55:19,587 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:55:19,634 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 18:55:19,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:55:19,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:55:19,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:55:19,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1796942584, now seen corresponding path program 2 times [2025-03-17 18:55:19,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:55:19,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365305379] [2025-03-17 18:55:19,788 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:55:19,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:55:21,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 18:55:22,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 18:55:22,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:55:22,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:55:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:55:23,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365305379] [2025-03-17 18:55:23,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365305379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:55:23,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:55:23,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:55:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921727328] [2025-03-17 18:55:23,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:55:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:55:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:55:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:55:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:55:23,573 INFO L87 Difference]: Start difference. First operand 573 states and 820 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:27,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:55:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:55:28,278 INFO L93 Difference]: Finished difference Result 573 states and 820 transitions. [2025-03-17 18:55:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:55:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 18:55:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:55:28,282 INFO L225 Difference]: With dead ends: 573 [2025-03-17 18:55:28,282 INFO L226 Difference]: Without dead ends: 571 [2025-03-17 18:55:28,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:55:28,283 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 511 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:55:28,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 2547 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 18:55:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-17 18:55:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-03-17 18:55:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 482 states have (on average 1.562240663900415) internal successors, (753), 531 states have internal predecessors, (753), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:55:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 818 transitions. [2025-03-17 18:55:28,299 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 818 transitions. Word has length 21 [2025-03-17 18:55:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:55:28,299 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 818 transitions. [2025-03-17 18:55:28,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 818 transitions. [2025-03-17 18:55:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 18:55:28,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:55:28,300 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:55:28,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:55:28,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:55:28,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:55:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash -572530180, now seen corresponding path program 1 times [2025-03-17 18:55:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:55:28,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403960953] [2025-03-17 18:55:28,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:55:30,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 18:55:30,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 18:55:30,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:30,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:55:31,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:55:31,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403960953] [2025-03-17 18:55:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403960953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:55:31,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:55:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:55:31,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513984648] [2025-03-17 18:55:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:55:31,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:55:31,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:55:31,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:55:31,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:55:31,341 INFO L87 Difference]: Start difference. First operand 571 states and 818 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:35,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:55:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:55:35,805 INFO L93 Difference]: Finished difference Result 1126 states and 1621 transitions. [2025-03-17 18:55:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:55:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 18:55:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:55:35,807 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 18:55:35,808 INFO L226 Difference]: Without dead ends: 574 [2025-03-17 18:55:35,809 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 18:55:35,809 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 1 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:55:35,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1543 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 18:55:35,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-17 18:55:35,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-03-17 18:55:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 485 states have (on average 1.5587628865979382) internal successors, (756), 534 states have internal predecessors, (756), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 18:55:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 821 transitions. [2025-03-17 18:55:35,824 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 821 transitions. Word has length 26 [2025-03-17 18:55:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:55:35,825 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 821 transitions. [2025-03-17 18:55:35,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:55:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 821 transitions. [2025-03-17 18:55:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:55:35,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:55:35,826 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:55:35,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:55:35,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 73 more)] === [2025-03-17 18:55:35,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:55:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -930396335, now seen corresponding path program 1 times [2025-03-17 18:55:35,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:55:35,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378997726] [2025-03-17 18:55:35,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:55:37,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:55:38,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:55:38,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:38,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:55:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:55:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378997726] [2025-03-17 18:55:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378997726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:55:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865037666] [2025-03-17 18:55:38,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:55:38,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:55:38,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:55:38,951 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 18:55:38,951 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 18:55:41,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:55:42,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:55:42,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:55:42,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:55:43,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 18568 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:55:43,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:55:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:55:43,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:55:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 18:55:43,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865037666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:55:43,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:55:43,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 18:55:43,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229317735] [2025-03-17 18:55:43,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:55:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:55:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:55:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:55:43,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:55:43,421 INFO L87 Difference]: Start difference. First operand 574 states and 821 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)