./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 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-1.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 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:38:10,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:38:10,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:38:10,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:38:10,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:38:10,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:38:10,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:38:10,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:38:10,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:38:10,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:38:10,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:38:10,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:38:10,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:38:10,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:38:10,846 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:38:10,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:38:10,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:38:10,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:38:10,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:38:10,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:38:10,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:10,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:38:10,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:38:10,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:38:10,849 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 -> 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 [2025-03-04 14:38:11,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:11,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:11,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:11,091 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:11,091 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:11,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-03-04 14:38:12,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b651098/c31e1765b658487891d0b8f43fc35b7b/FLAG99b5b5338 [2025-03-04 14:38:12,608 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:12,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-03-04 14:38:12,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b651098/c31e1765b658487891d0b8f43fc35b7b/FLAG99b5b5338 [2025-03-04 14:38:12,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b651098/c31e1765b658487891d0b8f43fc35b7b [2025-03-04 14:38:12,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:12,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:12,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:12,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:12,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:12,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0c892f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:12, skipping insertion in model container [2025-03-04 14:38:12,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:12" (1/1) ... [2025-03-04 14:38:12,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:13,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:13,914 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:14,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:14,369 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:38:14,380 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:14,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14 WrapperNode [2025-03-04 14:38:14,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:14,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:14,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:14,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:14,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,776 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11035 [2025-03-04 14:38:14,777 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:14,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:14,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:14,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:14,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,852 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:38:14,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:14,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:15,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:15,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:15,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:15,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (1/1) ... [2025-03-04 14:38:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:15,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:15,187 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-04 14:38:15,276 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-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-04 14:38:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-03-04 14:38:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-03-04 14:38:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-03-04 14:38:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:38:15,292 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:38:15,292 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:38:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-04 14:38:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:38:15,293 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-03-04 14:38:15,293 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-03-04 14:38:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-04 14:38:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-04 14:38:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-04 14:38:15,294 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-04 14:38:15,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:38:15,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:15,671 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:16,093 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3682: havoc lstat_#t~ret345#1; [2025-03-04 14:38:16,095 INFO L1325 $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-04 14:38:16,095 INFO L1325 $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-04 14:38:16,318 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3678: havoc #t~ret344#1; [2025-03-04 14:38:36,022 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2912: havoc __main_#t~mem136#1; [2025-03-04 14:38:36,023 INFO L1325 $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-04 14:38:36,023 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: havoc getopt_long_#t~ret373#1; [2025-03-04 14:38:36,233 INFO L? ?]: Removed 728 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:36,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:36,277 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:36,277 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:36,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:36 BoogieIcfgContainer [2025-03-04 14:38:36,278 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:36,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:36,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:36,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:36,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:12" (1/3) ... [2025-03-04 14:38:36,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f1ab0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:36, skipping insertion in model container [2025-03-04 14:38:36,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:14" (2/3) ... [2025-03-04 14:38:36,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f1ab0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:36, skipping insertion in model container [2025-03-04 14:38:36,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:36" (3/3) ... [2025-03-04 14:38:36,288 INFO L128 eAbstractionObserver]: Analyzing ICFG du-1.i [2025-03-04 14:38:36,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:36,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-1.i that has 14 procedures, 677 locations, 1 initial locations, 39 loop locations, and 69 error locations. [2025-03-04 14:38:36,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:36,376 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;@793c2f0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:36,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-03-04 14:38:36,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 677 states, 553 states have (on average 1.6383363471971066) internal successors, (906), 628 states have internal predecessors, (906), 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-04 14:38:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:36,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:36,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:36,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:38:36,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash 35677631, now seen corresponding path program 1 times [2025-03-04 14:38:36,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:36,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23806324] [2025-03-04 14:38:36,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:36,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:38,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:39,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:39,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:39,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:40,753 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-04 14:38:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23806324] [2025-03-04 14:38:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23806324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:40,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102670700] [2025-03-04 14:38:40,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:40,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:40,783 INFO L87 Difference]: Start difference. First operand has 677 states, 553 states have (on average 1.6383363471971066) internal successors, (906), 628 states have internal predecessors, (906), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 14:38:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:41,053 INFO L93 Difference]: Finished difference Result 1251 states and 1877 transitions. [2025-03-04 14:38:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:41,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-04 14:38:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:41,065 INFO L225 Difference]: With dead ends: 1251 [2025-03-04 14:38:41,066 INFO L226 Difference]: Without dead ends: 578 [2025-03-04 14:38:41,075 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-04 14:38:41,078 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1574 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-04 14:38:41,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1574 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:38:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-04 14:38:41,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-04 14:38:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 483 states have (on average 1.5734989648033126) internal successors, (760), 538 states have internal predecessors, (760), 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-04 14:38:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 825 transitions. [2025-03-04 14:38:41,143 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 825 transitions. Word has length 4 [2025-03-04 14:38:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:41,143 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 825 transitions. [2025-03-04 14:38:41,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-04 14:38:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 825 transitions. [2025-03-04 14:38:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:38:41,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:41,145 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:38:41,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:38:41,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:38:41,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:41,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2016468484, now seen corresponding path program 1 times [2025-03-04 14:38:41,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:41,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481915469] [2025-03-04 14:38:41,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:41,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:43,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:43,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:43,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:43,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:44,399 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-04 14:38:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481915469] [2025-03-04 14:38:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481915469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137497937] [2025-03-04 14:38:44,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:44,402 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-04 14:38:44,404 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-04 14:38:46,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:48,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 18366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:48,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:48,404 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-04 14:38:48,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137497937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:48,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:48,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475328655] [2025-03-04 14:38:48,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:48,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:48,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:48,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:48,406 INFO L87 Difference]: Start difference. First operand 578 states and 825 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-04 14:38:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:48,564 INFO L93 Difference]: Finished difference Result 578 states and 825 transitions. [2025-03-04 14:38:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:48,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-04 14:38:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:48,567 INFO L225 Difference]: With dead ends: 578 [2025-03-04 14:38:48,569 INFO L226 Difference]: Without dead ends: 577 [2025-03-04 14:38:48,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-04 14:38:48,570 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:48,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1569 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-04 14:38:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-03-04 14:38:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 483 states have (on average 1.5714285714285714) internal successors, (759), 537 states have internal predecessors, (759), 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-04 14:38:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 824 transitions. [2025-03-04 14:38:48,602 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 824 transitions. Word has length 7 [2025-03-04 14:38:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:48,602 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 824 transitions. [2025-03-04 14:38:48,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-04 14:38:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 824 transitions. [2025-03-04 14:38:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:48,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:48,603 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:48,652 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-04 14:38:48,803 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-04 14:38:48,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:38:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1913985343, now seen corresponding path program 1 times [2025-03-04 14:38:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114848261] [2025-03-04 14:38:48,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:50,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:50,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:50,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:51,390 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-04 14:38:51,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:51,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114848261] [2025-03-04 14:38:51,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114848261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:51,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:51,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:51,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603333451] [2025-03-04 14:38:51,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:51,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:51,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:51,391 INFO L87 Difference]: Start difference. First operand 577 states and 824 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 14:38:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:51,497 INFO L93 Difference]: Finished difference Result 577 states and 824 transitions. [2025-03-04 14:38:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-04 14:38:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:51,501 INFO L225 Difference]: With dead ends: 577 [2025-03-04 14:38:51,501 INFO L226 Difference]: Without dead ends: 576 [2025-03-04 14:38:51,501 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-04 14:38:51,501 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 0 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1570 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:51,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1570 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:51,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-04 14:38:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2025-03-04 14:38:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 481 states have (on average 1.5717255717255718) 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-04 14:38:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 821 transitions. [2025-03-04 14:38:51,517 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 821 transitions. Word has length 8 [2025-03-04 14:38:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:51,517 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 821 transitions. [2025-03-04 14:38:51,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04 14:38:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 821 transitions. [2025-03-04 14:38:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:38:51,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:51,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:51,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:38:51,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:38:51,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:51,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1728624736, now seen corresponding path program 1 times [2025-03-04 14:38:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269589875] [2025-03-04 14:38:51,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:53,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:53,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:53,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:53,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:54,146 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-04 14:38:54,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269589875] [2025-03-04 14:38:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269589875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369796577] [2025-03-04 14:38:54,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:54,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:54,149 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-04 14:38:54,150 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-04 14:38:56,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:57,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:57,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:57,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:57,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:57,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:57,728 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-04 14:38:57,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:57,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369796577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:57,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:57,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:38:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684597051] [2025-03-04 14:38:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:57,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:57,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:57,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:57,730 INFO L87 Difference]: Start difference. First operand 574 states and 821 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-04 14:38:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:57,806 INFO L93 Difference]: Finished difference Result 574 states and 821 transitions. [2025-03-04 14:38:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:57,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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 12 [2025-03-04 14:38:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:57,809 INFO L225 Difference]: With dead ends: 574 [2025-03-04 14:38:57,809 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 14:38:57,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-04 14:38:57,810 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 517 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:57,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1063 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 14:38:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-04 14:38:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 481 states have (on average 1.5675675675675675) internal successors, (754), 532 states have internal predecessors, (754), 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-04 14:38:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 819 transitions. [2025-03-04 14:38:57,825 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 819 transitions. Word has length 12 [2025-03-04 14:38:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:57,826 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 819 transitions. [2025-03-04 14:38:57,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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-04 14:38:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 819 transitions. [2025-03-04 14:38:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:38:57,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:57,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:57,867 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-04 14:38:58,027 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-04 14:38:58,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:38:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2047758177, now seen corresponding path program 1 times [2025-03-04 14:38:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555638851] [2025-03-04 14:38:58,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:59,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:59,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:59,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:00,582 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-04 14:39:00,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555638851] [2025-03-04 14:39:00,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555638851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:00,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513132599] [2025-03-04 14:39:00,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:00,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:00,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:00,585 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-04 14:39:00,586 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-04 14:39:02,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:39:04,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:39:04,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:04,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:04,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 18384 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:04,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:04,118 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-04 14:39:04,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:04,144 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-04 14:39:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513132599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:04,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:39:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113352554] [2025-03-04 14:39:04,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:04,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:04,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:04,145 INFO L87 Difference]: Start difference. First operand 572 states and 819 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-04 14:39:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:04,322 INFO L93 Difference]: Finished difference Result 1147 states and 1643 transitions. [2025-03-04 14:39:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:04,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 13 [2025-03-04 14:39:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:04,324 INFO L225 Difference]: With dead ends: 1147 [2025-03-04 14:39:04,324 INFO L226 Difference]: Without dead ends: 581 [2025-03-04 14:39:04,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-04 14:39:04,329 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 4 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:04,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3130 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:04,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-04 14:39:04,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-03-04 14:39:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 490 states have (on average 1.5571428571428572) internal successors, (763), 541 states have internal predecessors, (763), 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-04 14:39:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 828 transitions. [2025-03-04 14:39:04,347 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 828 transitions. Word has length 13 [2025-03-04 14:39:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 828 transitions. [2025-03-04 14:39:04,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-04 14:39:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 828 transitions. [2025-03-04 14:39:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:39:04,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:04,348 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:04,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:39:04,548 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-04 14:39:04,548 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:04,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:04,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1922939942, now seen corresponding path program 2 times [2025-03-04 14:39:04,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:04,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348501982] [2025-03-04 14:39:04,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:39:04,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:06,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:39:06,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:39:06,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:39:06,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:07,608 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-04 14:39:07,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:07,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348501982] [2025-03-04 14:39:07,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348501982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:07,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:07,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:39:07,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330911986] [2025-03-04 14:39:07,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:07,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:39:07,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:07,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:39:07,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:07,609 INFO L87 Difference]: Start difference. First operand 581 states and 828 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-04 14:39:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:07,785 INFO L93 Difference]: Finished difference Result 581 states and 828 transitions. [2025-03-04 14:39:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:39:07,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-04 14:39:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:07,788 INFO L225 Difference]: With dead ends: 581 [2025-03-04 14:39:07,788 INFO L226 Difference]: Without dead ends: 579 [2025-03-04 14:39:07,789 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-04 14:39:07,789 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 516 mSDsluCounter, 1803 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:07,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2574 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-04 14:39:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2025-03-04 14:39:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 490 states have (on average 1.5530612244897959) internal successors, (761), 539 states have internal predecessors, (761), 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-04 14:39:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 826 transitions. [2025-03-04 14:39:07,807 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 826 transitions. Word has length 22 [2025-03-04 14:39:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:07,807 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 826 transitions. [2025-03-04 14:39:07,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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-04 14:39:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 826 transitions. [2025-03-04 14:39:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:39:07,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:07,808 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:39:07,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2042207168, now seen corresponding path program 1 times [2025-03-04 14:39:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476807122] [2025-03-04 14:39:07,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:39:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:39:09,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:09,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:10,408 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-04 14:39:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476807122] [2025-03-04 14:39:10,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476807122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:10,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:39:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23709857] [2025-03-04 14:39:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:10,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:10,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:10,410 INFO L87 Difference]: Start difference. First operand 579 states and 826 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04 14:39:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:10,513 INFO L93 Difference]: Finished difference Result 1141 states and 1636 transitions. [2025-03-04 14:39:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:10,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-03-04 14:39:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:10,517 INFO L225 Difference]: With dead ends: 1141 [2025-03-04 14:39:10,517 INFO L226 Difference]: Without dead ends: 582 [2025-03-04 14:39:10,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:10,518 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 2 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:10,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1559 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-04 14:39:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-03-04 14:39:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 493 states have (on average 1.5496957403651115) internal successors, (764), 542 states have internal predecessors, (764), 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-04 14:39:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 829 transitions. [2025-03-04 14:39:10,530 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 829 transitions. Word has length 27 [2025-03-04 14:39:10,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 829 transitions. [2025-03-04 14:39:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-04 14:39:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 829 transitions. [2025-03-04 14:39:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:39:10,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:10,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:10,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:39:10,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:10,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1176158061, now seen corresponding path program 1 times [2025-03-04 14:39:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133205655] [2025-03-04 14:39:10,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:12,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:12,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:12,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:12,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:39:13,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133205655] [2025-03-04 14:39:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133205655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:13,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:13,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006602494] [2025-03-04 14:39:13,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:13,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:13,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:13,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:13,042 INFO L87 Difference]: Start difference. First operand 582 states and 829 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-04 14:39:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:13,138 INFO L93 Difference]: Finished difference Result 595 states and 844 transitions. [2025-03-04 14:39:13,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:13,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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 30 [2025-03-04 14:39:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:13,140 INFO L225 Difference]: With dead ends: 595 [2025-03-04 14:39:13,140 INFO L226 Difference]: Without dead ends: 593 [2025-03-04 14:39:13,141 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-04 14:39:13,141 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 3 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:13,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1556 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-04 14:39:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2025-03-04 14:39:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 502 states have (on average 1.547808764940239) internal successors, (777), 551 states have internal predecessors, (777), 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-04 14:39:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 842 transitions. [2025-03-04 14:39:13,152 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 842 transitions. Word has length 30 [2025-03-04 14:39:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 842 transitions. [2025-03-04 14:39:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 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-04 14:39:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 842 transitions. [2025-03-04 14:39:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:39:13,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:13,153 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:13,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:39:13,153 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:13,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1176157901, now seen corresponding path program 1 times [2025-03-04 14:39:13,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:13,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996574120] [2025-03-04 14:39:13,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:14,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:14,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:14,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:15,669 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-04 14:39:15,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996574120] [2025-03-04 14:39:15,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996574120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:15,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386967886] [2025-03-04 14:39:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:15,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:15,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:15,672 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-04 14:39:15,672 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-04 14:39:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:39:19,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:39:19,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:19,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:19,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 18569 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:39:19,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:19,308 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-04 14:39:19,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:19,387 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-04 14:39:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386967886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:19,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:19,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:39:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549839975] [2025-03-04 14:39:19,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:19,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:39:19,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:19,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:39:19,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:39:19,388 INFO L87 Difference]: Start difference. First operand 591 states and 842 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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) [2025-03-04 14:39:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:19,643 INFO L93 Difference]: Finished difference Result 1184 states and 1692 transitions. [2025-03-04 14:39:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:39:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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) Word has length 30 [2025-03-04 14:39:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:19,646 INFO L225 Difference]: With dead ends: 1184 [2025-03-04 14:39:19,646 INFO L226 Difference]: Without dead ends: 608 [2025-03-04 14:39:19,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:39:19,648 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 5 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4646 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:19,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4646 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-04 14:39:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-04 14:39:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 520 states have (on average 1.525) internal successors, (793), 568 states have internal predecessors, (793), 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-04 14:39:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 858 transitions. [2025-03-04 14:39:19,663 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 858 transitions. Word has length 30 [2025-03-04 14:39:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:19,664 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 858 transitions. [2025-03-04 14:39:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 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) [2025-03-04 14:39:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 858 transitions. [2025-03-04 14:39:19,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:39:19,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:19,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:19,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:39:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:19,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash 613516226, now seen corresponding path program 1 times [2025-03-04 14:39:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882054439] [2025-03-04 14:39:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:21,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:39:21,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:39:21,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:21,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:22,177 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:39:22,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:22,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882054439] [2025-03-04 14:39:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882054439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:22,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:22,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744357674] [2025-03-04 14:39:22,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:22,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:22,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:22,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:22,178 INFO L87 Difference]: Start difference. First operand 608 states and 858 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-04 14:39:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:22,268 INFO L93 Difference]: Finished difference Result 608 states and 858 transitions. [2025-03-04 14:39:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-04 14:39:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:22,271 INFO L225 Difference]: With dead ends: 608 [2025-03-04 14:39:22,271 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 14:39:22,272 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-04 14:39:22,272 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:22,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1557 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 14:39:22,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-03-04 14:39:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 516 states have (on average 1.5251937984496124) internal successors, (787), 563 states have internal predecessors, (787), 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-04 14:39:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 852 transitions. [2025-03-04 14:39:22,287 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 852 transitions. Word has length 49 [2025-03-04 14:39:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:22,287 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 852 transitions. [2025-03-04 14:39:22,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-04 14:39:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 852 transitions. [2025-03-04 14:39:22,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:39:22,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:22,290 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:22,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:39:22,290 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:22,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:22,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1757376176, now seen corresponding path program 1 times [2025-03-04 14:39:22,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:22,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862766495] [2025-03-04 14:39:22,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:24,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:39:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:39:24,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:24,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:39:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862766495] [2025-03-04 14:39:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862766495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:39:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331836713] [2025-03-04 14:39:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:25,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:25,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:25,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:25,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:39:25,027 INFO L87 Difference]: Start difference. First operand 603 states and 852 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-04 14:39:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:25,135 INFO L93 Difference]: Finished difference Result 1151 states and 1642 transitions. [2025-03-04 14:39:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:25,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 50 [2025-03-04 14:39:25,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:25,139 INFO L225 Difference]: With dead ends: 1151 [2025-03-04 14:39:25,139 INFO L226 Difference]: Without dead ends: 605 [2025-03-04 14:39:25,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:39:25,141 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 0 mSDsluCounter, 1557 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2338 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:25,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2338 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-04 14:39:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-03-04 14:39:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 518 states have (on average 1.5231660231660231) internal successors, (789), 565 states have internal predecessors, (789), 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-04 14:39:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 854 transitions. [2025-03-04 14:39:25,154 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 854 transitions. Word has length 50 [2025-03-04 14:39:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:25,154 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 854 transitions. [2025-03-04 14:39:25,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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-04 14:39:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 854 transitions. [2025-03-04 14:39:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 14:39:25,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:25,156 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:39:25,156 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:25,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1758299697, now seen corresponding path program 1 times [2025-03-04 14:39:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728797122] [2025-03-04 14:39:25,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:26,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 14:39:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 14:39:26,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:26,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:39:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728797122] [2025-03-04 14:39:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728797122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:27,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:39:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:39:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500753171] [2025-03-04 14:39:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:27,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:39:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:27,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:39:27,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:39:27,578 INFO L87 Difference]: Start difference. First operand 605 states and 854 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 14:39:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:27,688 INFO L93 Difference]: Finished difference Result 900 states and 1288 transitions. [2025-03-04 14:39:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:39:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 50 [2025-03-04 14:39:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:27,692 INFO L225 Difference]: With dead ends: 900 [2025-03-04 14:39:27,692 INFO L226 Difference]: Without dead ends: 898 [2025-03-04 14:39:27,692 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-04 14:39:27,692 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 410 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1545 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:39:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-03-04 14:39:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 609. [2025-03-04 14:39:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 522 states have (on average 1.5210727969348659) internal successors, (794), 569 states have internal predecessors, (794), 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-04 14:39:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 859 transitions. [2025-03-04 14:39:27,707 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 859 transitions. Word has length 50 [2025-03-04 14:39:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:27,707 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 859 transitions. [2025-03-04 14:39:27,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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-04 14:39:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 859 transitions. [2025-03-04 14:39:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 14:39:27,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:27,709 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:27,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:39:27,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:27,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1623352075, now seen corresponding path program 1 times [2025-03-04 14:39:27,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:27,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129382988] [2025-03-04 14:39:27,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:29,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:39:29,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:39:29,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:29,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:39:30,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129382988] [2025-03-04 14:39:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129382988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:30,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76007269] [2025-03-04 14:39:30,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:30,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:30,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:39:32,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 14:39:33,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 14:39:33,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:33,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:33,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 18732 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:33,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:39:33,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:39:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76007269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:39:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:39:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:39:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672711867] [2025-03-04 14:39:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:39:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:39:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:33,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:39:33,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:39:33,972 INFO L87 Difference]: Start difference. First operand 609 states and 859 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-04 14:39:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:34,163 INFO L93 Difference]: Finished difference Result 902 states and 1291 transitions. [2025-03-04 14:39:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:39:34,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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 54 [2025-03-04 14:39:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:34,167 INFO L225 Difference]: With dead ends: 902 [2025-03-04 14:39:34,167 INFO L226 Difference]: Without dead ends: 901 [2025-03-04 14:39:34,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-04 14:39:34,168 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 819 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:34,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 2333 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-03-04 14:39:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 608. [2025-03-04 14:39:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 522 states have (on average 1.5191570881226053) internal successors, (793), 568 states have internal predecessors, (793), 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-04 14:39:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 858 transitions. [2025-03-04 14:39:34,186 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 858 transitions. Word has length 54 [2025-03-04 14:39:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:34,186 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 858 transitions. [2025-03-04 14:39:34,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 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-04 14:39:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 858 transitions. [2025-03-04 14:39:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:39:34,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:34,187 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:34,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:39:34,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 14:39:34,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:34,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 423138360, now seen corresponding path program 1 times [2025-03-04 14:39:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:34,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858593960] [2025-03-04 14:39:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:39:36,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:39:36,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:39:36,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:39:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858593960] [2025-03-04 14:39:36,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858593960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:39:36,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317990823] [2025-03-04 14:39:36,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:36,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:39:36,923 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:39:36,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:39:38,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:39:40,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:39:40,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:39:40,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:39:40,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 18738 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:39:40,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:39:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:40,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:39:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:39:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317990823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:39:40,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:39:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:39:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075847955] [2025-03-04 14:39:40,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:39:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:39:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:39:40,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:39:40,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:39:40,737 INFO L87 Difference]: Start difference. First operand 608 states and 858 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-04 14:39:40,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:39:40,964 INFO L93 Difference]: Finished difference Result 1191 states and 1693 transitions. [2025-03-04 14:39:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:39:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 55 [2025-03-04 14:39:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:39:40,967 INFO L225 Difference]: With dead ends: 1191 [2025-03-04 14:39:40,967 INFO L226 Difference]: Without dead ends: 626 [2025-03-04 14:39:40,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 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-04 14:39:40,968 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 4 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:39:40,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3107 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:39:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-04 14:39:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-03-04 14:39:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 540 states have (on average 1.5018518518518518) internal successors, (811), 586 states have internal predecessors, (811), 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-04 14:39:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 876 transitions. [2025-03-04 14:39:40,979 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 876 transitions. Word has length 55 [2025-03-04 14:39:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:39:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 876 transitions. [2025-03-04 14:39:40,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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-04 14:39:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 876 transitions. [2025-03-04 14:39:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:39:40,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:39:40,980 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:39:41,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:39:41,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:39:41,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-03-04 14:39:41,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:39:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1215694284, now seen corresponding path program 1 times [2025-03-04 14:39:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:39:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484219982] [2025-03-04 14:39:41,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:39:41,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms