./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-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/printf-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 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:41:15,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:41:15,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:41:15,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:41:15,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:41:15,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:41:15,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:41:15,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:41:15,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:41:15,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:41:15,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:41:15,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:41:15,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:41:15,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:41:15,175 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:41:15,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:41:15,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:41:15,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:41:15,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:41:15,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:41:15,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:15,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:41:15,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:41:15,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:41:15,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:41:15,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:41:15,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:41:15,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:41:15,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:41:15,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:41:15,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:41:15,178 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 -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-03-04 14:41:15,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:41:15,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:41:15,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:41:15,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:41:15,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:41:15,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-03-04 14:41:16,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fff1aa52/489bac2a352340c1a2d9b584d72b9fcb/FLAG0a81072dd [2025-03-04 14:41:16,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:41:16,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-03-04 14:41:16,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fff1aa52/489bac2a352340c1a2d9b584d72b9fcb/FLAG0a81072dd [2025-03-04 14:41:17,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fff1aa52/489bac2a352340c1a2d9b584d72b9fcb [2025-03-04 14:41:17,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:41:17,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:41:17,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:17,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:41:17,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:41:17,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:17" (1/1) ... [2025-03-04 14:41:17,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f014257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:17, skipping insertion in model container [2025-03-04 14:41:17,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:17" (1/1) ... [2025-03-04 14:41:17,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:41:17,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:17,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:41:18,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:18,196 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:41:18,203 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:41:18,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18 WrapperNode [2025-03-04 14:41:18,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:18,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:18,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:41:18,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:41:18,209 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:41:18" (1/1) ... [2025-03-04 14:41:18,234 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:41:18" (1/1) ... [2025-03-04 14:41:18,296 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1869 [2025-03-04 14:41:18,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:18,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:41:18,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:41:18,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:41:18,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,333 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:41:18,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,391 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,397 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:41:18,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:41:18,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:41:18,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:41:18,437 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:18,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:18,465 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:41:18,468 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:41:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 14:41:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-04 14:41:18,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-04 14:41:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:41:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:41:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-04 14:41:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:41:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:41:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:41:18,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:41:18,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:41:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:41:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:41:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-04 14:41:18,491 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-04 14:41:18,491 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-04 14:41:18,491 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:41:18,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-04 14:41:18,492 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:41:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-04 14:41:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-04 14:41:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-04 14:41:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:41:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-04 14:41:18,493 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-04 14:41:18,855 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:41:18,856 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:41:18,933 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-04 14:41:19,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-04 14:41:19,206 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-04 14:41:19,344 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-04 14:41:19,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-04 14:41:19,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-04 14:41:19,345 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-04 14:41:23,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-04 14:41:23,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-04 14:41:23,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-04 14:41:24,101 INFO L? ?]: Removed 636 outVars from TransFormulas that were not future-live. [2025-03-04 14:41:24,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:41:24,123 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:41:24,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:41:24,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24 BoogieIcfgContainer [2025-03-04 14:41:24,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:41:24,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:41:24,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:41:24,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:41:24,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:41:17" (1/3) ... [2025-03-04 14:41:24,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38becd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:41:24, skipping insertion in model container [2025-03-04 14:41:24,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (2/3) ... [2025-03-04 14:41:24,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38becd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:41:24, skipping insertion in model container [2025-03-04 14:41:24,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24" (3/3) ... [2025-03-04 14:41:24,129 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-03-04 14:41:24,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:41:24,147 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 507 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-03-04 14:41:24,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:41:24,209 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;@6e1fdc0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:41:24,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-04 14:41:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 507 states, 388 states have (on average 1.5850515463917525) internal successors, (615), 455 states have internal predecessors, (615), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 14:41:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:41:24,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:24,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:41:24,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:24,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:24,229 INFO L85 PathProgramCache]: Analyzing trace with hash 24810879, now seen corresponding path program 1 times [2025-03-04 14:41:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336237789] [2025-03-04 14:41:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:24,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:41:24,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:41:24,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:25,331 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:41:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336237789] [2025-03-04 14:41:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336237789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:25,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:25,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071308385] [2025-03-04 14:41:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:25,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:25,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:25,352 INFO L87 Difference]: Start difference. First operand has 507 states, 388 states have (on average 1.5850515463917525) internal successors, (615), 455 states have internal predecessors, (615), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) 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:41:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:25,480 INFO L93 Difference]: Finished difference Result 899 states and 1336 transitions. [2025-03-04 14:41:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:25,484 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:41:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:25,492 INFO L225 Difference]: With dead ends: 899 [2025-03-04 14:41:25,492 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 14:41:25,500 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:41:25,502 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:25,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1077 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:25,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 14:41:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-04 14:41:25,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 317 states have (on average 1.4258675078864353) internal successors, (452), 333 states have internal predecessors, (452), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 519 transitions. [2025-03-04 14:41:25,557 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 519 transitions. Word has length 4 [2025-03-04 14:41:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:25,558 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 519 transitions. [2025-03-04 14:41:25,558 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:41:25,559 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 519 transitions. [2025-03-04 14:41:25,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:41:25,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:25,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:41:25,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:41:25,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:25,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 407256323, now seen corresponding path program 1 times [2025-03-04 14:41:25,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:25,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639961355] [2025-03-04 14:41:25,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:26,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:41:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:41:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:26,349 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:41:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639961355] [2025-03-04 14:41:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639961355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880769557] [2025-03-04 14:41:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:26,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:26,355 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:41:26,356 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:41:26,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:41:27,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:41:27,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:27,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:27,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:27,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:27,207 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:41:27,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880769557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:27,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:41:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917965339] [2025-03-04 14:41:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:41:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:27,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:41:27,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:27,209 INFO L87 Difference]: Start difference. First operand 378 states and 519 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:41:27,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:27,297 INFO L93 Difference]: Finished difference Result 378 states and 519 transitions. [2025-03-04 14:41:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:41:27,297 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:41:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:27,299 INFO L225 Difference]: With dead ends: 378 [2025-03-04 14:41:27,301 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 14:41:27,301 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:41:27,302 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:27,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1516 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 14:41:27,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-04 14:41:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 332 states have internal predecessors, (451), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 518 transitions. [2025-03-04 14:41:27,315 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 518 transitions. Word has length 7 [2025-03-04 14:41:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 518 transitions. [2025-03-04 14:41:27,316 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:41:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 518 transitions. [2025-03-04 14:41:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:41:27,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:27,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:41:27,328 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:41:27,518 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:41:27,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:27,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:27,519 INFO L85 PathProgramCache]: Analyzing trace with hash -259955135, now seen corresponding path program 1 times [2025-03-04 14:41:27,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:27,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658555663] [2025-03-04 14:41:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:28,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:41:28,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:41:28,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:28,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:28,198 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:41:28,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:28,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658555663] [2025-03-04 14:41:28,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658555663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:28,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:28,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684121356] [2025-03-04 14:41:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:28,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:28,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:28,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:28,199 INFO L87 Difference]: Start difference. First operand 377 states and 518 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:41:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:28,245 INFO L93 Difference]: Finished difference Result 377 states and 518 transitions. [2025-03-04 14:41:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:28,245 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:41:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:28,247 INFO L225 Difference]: With dead ends: 377 [2025-03-04 14:41:28,247 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 14:41:28,248 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:41:28,248 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:28,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 14:41:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2025-03-04 14:41:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 329 states have internal predecessors, (448), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 515 transitions. [2025-03-04 14:41:28,266 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 515 transitions. Word has length 8 [2025-03-04 14:41:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:28,266 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 515 transitions. [2025-03-04 14:41:28,266 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:41:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 515 transitions. [2025-03-04 14:41:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:41:28,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:28,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:28,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:41:28,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:28,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash -103173944, now seen corresponding path program 1 times [2025-03-04 14:41:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:28,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888732827] [2025-03-04 14:41:28,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:28,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:28,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:41:28,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:41:28,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:28,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:28,887 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:41:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888732827] [2025-03-04 14:41:28,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888732827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:28,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451829504] [2025-03-04 14:41:28,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:28,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:28,889 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:41:28,891 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:41:29,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:41:29,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:41:29,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:29,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:29,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:41:29,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:29,687 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:41:29,687 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:29,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451829504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:29,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:29,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:41:29,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273751655] [2025-03-04 14:41:29,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:29,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:29,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:29,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:29,691 INFO L87 Difference]: Start difference. First operand 374 states and 515 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:41:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:29,766 INFO L93 Difference]: Finished difference Result 374 states and 515 transitions. [2025-03-04 14:41:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:29,766 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:41:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:29,769 INFO L225 Difference]: With dead ends: 374 [2025-03-04 14:41:29,769 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 14:41:29,769 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:41:29,769 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 163 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:29,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 830 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 14:41:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-04 14:41:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 315 states have (on average 1.415873015873016) internal successors, (446), 327 states have internal predecessors, (446), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 513 transitions. [2025-03-04 14:41:29,787 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 513 transitions. Word has length 12 [2025-03-04 14:41:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:29,789 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 513 transitions. [2025-03-04 14:41:29,789 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:41:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 513 transitions. [2025-03-04 14:41:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:41:29,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:29,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:29,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:29,990 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:41:29,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:29,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1096575766, now seen corresponding path program 1 times [2025-03-04 14:41:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682262676] [2025-03-04 14:41:29,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:30,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:41:30,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:41:30,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:30,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:30,668 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:41:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682262676] [2025-03-04 14:41:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682262676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603575344] [2025-03-04 14:41:30,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:30,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:30,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:30,670 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:41:30,672 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:41:31,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:41:31,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:41:31,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:31,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:31,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:31,537 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:41:31,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:31,583 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:41:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603575344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:31,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:41:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310103791] [2025-03-04 14:41:31,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:41:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:31,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:41:31,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:31,584 INFO L87 Difference]: Start difference. First operand 372 states and 513 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:41:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:31,672 INFO L93 Difference]: Finished difference Result 747 states and 1031 transitions. [2025-03-04 14:41:31,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:31,672 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:41:31,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:31,674 INFO L225 Difference]: With dead ends: 747 [2025-03-04 14:41:31,674 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 14:41:31,675 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:41:31,675 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 4 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:31,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2014 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:31,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 14:41:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-04 14:41:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 324 states have (on average 1.404320987654321) internal successors, (455), 336 states have internal predecessors, (455), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:31,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 522 transitions. [2025-03-04 14:41:31,685 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 522 transitions. Word has length 13 [2025-03-04 14:41:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:31,686 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 522 transitions. [2025-03-04 14:41:31,686 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:41:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 522 transitions. [2025-03-04 14:41:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:41:31,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:31,686 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:31,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:31,891 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:41:31,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:31,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1048880750, now seen corresponding path program 2 times [2025-03-04 14:41:31,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:31,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516948934] [2025-03-04 14:41:31,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:41:31,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:32,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:41:32,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:41:32,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:41:32,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:32,583 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:41:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516948934] [2025-03-04 14:41:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516948934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:32,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:41:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878520040] [2025-03-04 14:41:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:32,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:41:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:32,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:41:32,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:32,585 INFO L87 Difference]: Start difference. First operand 381 states and 522 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:41:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:32,729 INFO L93 Difference]: Finished difference Result 381 states and 522 transitions. [2025-03-04 14:41:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:41:32,730 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:41:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:32,733 INFO L225 Difference]: With dead ends: 381 [2025-03-04 14:41:32,733 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 14:41:32,734 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:41:32,734 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 162 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:32,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1811 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:32,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 14:41:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-04 14:41:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 334 states have internal predecessors, (453), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-03-04 14:41:32,748 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 22 [2025-03-04 14:41:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:32,748 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-03-04 14:41:32,749 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:41:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-03-04 14:41:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:41:32,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:32,749 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:41:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:41:32,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:32,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash -176560025, now seen corresponding path program 1 times [2025-03-04 14:41:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:32,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605892287] [2025-03-04 14:41:32,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:41:33,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:41:33,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:33,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:33,401 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:41:33,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:33,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605892287] [2025-03-04 14:41:33,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605892287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:33,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:33,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:41:33,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923865822] [2025-03-04 14:41:33,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:33,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:33,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:33,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:33,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:33,403 INFO L87 Difference]: Start difference. First operand 379 states and 520 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:41:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:33,474 INFO L93 Difference]: Finished difference Result 741 states and 1024 transitions. [2025-03-04 14:41:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:33,475 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:41:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:33,477 INFO L225 Difference]: With dead ends: 741 [2025-03-04 14:41:33,477 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 14:41:33,479 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:41:33,480 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:33,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1001 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 14:41:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-04 14:41:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 327 states have (on average 1.3944954128440368) internal successors, (456), 337 states have internal predecessors, (456), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 523 transitions. [2025-03-04 14:41:33,497 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 523 transitions. Word has length 27 [2025-03-04 14:41:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:33,497 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 523 transitions. [2025-03-04 14:41:33,498 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:41:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 523 transitions. [2025-03-04 14:41:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:41:33,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:33,499 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:41:33,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:41:33,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:33,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:33,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1440718283, now seen corresponding path program 1 times [2025-03-04 14:41:33,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792141553] [2025-03-04 14:41:33,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:33,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:33,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:33,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:33,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:34,082 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:41:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792141553] [2025-03-04 14:41:34,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792141553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504001474] [2025-03-04 14:41:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:34,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:34,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:34,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:34,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:34,083 INFO L87 Difference]: Start difference. First operand 382 states and 523 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:41:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:34,164 INFO L93 Difference]: Finished difference Result 395 states and 538 transitions. [2025-03-04 14:41:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:34,164 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:41:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:34,166 INFO L225 Difference]: With dead ends: 395 [2025-03-04 14:41:34,166 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 14:41:34,166 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:41:34,166 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 3 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:34,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 998 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 14:41:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2025-03-04 14:41:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 336 states have (on average 1.3958333333333333) internal successors, (469), 346 states have internal predecessors, (469), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 536 transitions. [2025-03-04 14:41:34,177 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 536 transitions. Word has length 30 [2025-03-04 14:41:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:34,178 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 536 transitions. [2025-03-04 14:41:34,178 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:41:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 536 transitions. [2025-03-04 14:41:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:41:34,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:34,178 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:41:34,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:41:34,179 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:34,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1440718443, now seen corresponding path program 1 times [2025-03-04 14:41:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500670286] [2025-03-04 14:41:34,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:34,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:34,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:34,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:34,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:34,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:34,754 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:41:34,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:34,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500670286] [2025-03-04 14:41:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500670286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:34,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395691435] [2025-03-04 14:41:34,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:34,757 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:41:34,759 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:41:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:35,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:35,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:35,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:35,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:41:35,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:35,779 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:41:35,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:35,904 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:41:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395691435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:35,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:35,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:41:35,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138629494] [2025-03-04 14:41:35,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:35,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:41:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:35,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:41:35,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:35,905 INFO L87 Difference]: Start difference. First operand 391 states and 536 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:41:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:36,199 INFO L93 Difference]: Finished difference Result 784 states and 1080 transitions. [2025-03-04 14:41:36,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:41:36,200 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:41:36,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:36,201 INFO L225 Difference]: With dead ends: 784 [2025-03-04 14:41:36,201 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 14:41:36,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:36,203 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 5 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:36,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2972 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:41:36,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 14:41:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 14:41:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 354 states have (on average 1.3700564971751412) internal successors, (485), 363 states have internal predecessors, (485), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 552 transitions. [2025-03-04 14:41:36,213 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 552 transitions. Word has length 30 [2025-03-04 14:41:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 552 transitions. [2025-03-04 14:41:36,213 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:41:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 552 transitions. [2025-03-04 14:41:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:41:36,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:36,214 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:41:36,225 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:41:36,414 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:41:36,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1219044023, now seen corresponding path program 1 times [2025-03-04 14:41:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725229963] [2025-03-04 14:41:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:36,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:41:36,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:41:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:37,040 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:41:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:37,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725229963] [2025-03-04 14:41:37,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725229963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:37,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:37,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:37,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103351623] [2025-03-04 14:41:37,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:37,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:37,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:37,043 INFO L87 Difference]: Start difference. First operand 408 states and 552 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:41:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:37,099 INFO L93 Difference]: Finished difference Result 408 states and 552 transitions. [2025-03-04 14:41:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:37,100 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:41:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:37,102 INFO L225 Difference]: With dead ends: 408 [2025-03-04 14:41:37,102 INFO L226 Difference]: Without dead ends: 407 [2025-03-04 14:41:37,102 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:41:37,102 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:37,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-04 14:41:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2025-03-04 14:41:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 350 states have (on average 1.3685714285714285) internal successors, (479), 358 states have internal predecessors, (479), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 546 transitions. [2025-03-04 14:41:37,115 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 546 transitions. Word has length 49 [2025-03-04 14:41:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:37,116 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 546 transitions. [2025-03-04 14:41:37,116 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:41:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 546 transitions. [2025-03-04 14:41:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:41:37,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:37,117 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] [2025-03-04 14:41:37,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:41:37,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:37,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1571937225, now seen corresponding path program 1 times [2025-03-04 14:41:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301336072] [2025-03-04 14:41:37,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:37,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:41:37,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:41:37,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:37,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:37,676 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:41:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301336072] [2025-03-04 14:41:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301336072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064132185] [2025-03-04 14:41:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:37,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:37,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:37,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:37,677 INFO L87 Difference]: Start difference. First operand 403 states and 546 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:41:37,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:37,740 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2025-03-04 14:41:37,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:37,740 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:41:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:37,743 INFO L225 Difference]: With dead ends: 408 [2025-03-04 14:41:37,743 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 14:41:37,743 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:41:37,744 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:37,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 998 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 14:41:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-04 14:41:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 361 states have internal predecessors, (482), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2025-03-04 14:41:37,757 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 49 [2025-03-04 14:41:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:37,758 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2025-03-04 14:41:37,758 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:41:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2025-03-04 14:41:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 14:41:37,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:37,760 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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:41:37,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:41:37,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:37,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1553936327, now seen corresponding path program 1 times [2025-03-04 14:41:37,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:37,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326042074] [2025-03-04 14:41:37,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:37,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:38,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 14:41:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 14:41:38,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:38,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326042074] [2025-03-04 14:41:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326042074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557135960] [2025-03-04 14:41:38,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:38,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:38,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:38,362 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:41:38,363 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:41:39,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 14:41:39,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 14:41:39,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:39,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:39,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:41:39,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:39,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557135960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-04 14:41:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782167797] [2025-03-04 14:41:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:39,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:41:39,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:39,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:41:39,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:39,347 INFO L87 Difference]: Start difference. First operand 406 states and 549 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:41:39,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:39,415 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2025-03-04 14:41:39,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:41:39,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 52 [2025-03-04 14:41:39,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:39,417 INFO L225 Difference]: With dead ends: 417 [2025-03-04 14:41:39,417 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 14:41:39,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:39,419 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:39,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1500 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 14:41:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 14:41:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.3633802816901408) internal successors, (484), 363 states have internal predecessors, (484), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 551 transitions. [2025-03-04 14:41:39,434 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 551 transitions. Word has length 52 [2025-03-04 14:41:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 551 transitions. [2025-03-04 14:41:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:41:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2025-03-04 14:41:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:41:39,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:39,436 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:41:39,448 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:41:39,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:41:39,637 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:39,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:39,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1171095583, now seen corresponding path program 1 times [2025-03-04 14:41:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:39,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655958178] [2025-03-04 14:41:39,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:39,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:40,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:41:40,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:41:40,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:40,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:40,238 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:41:40,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655958178] [2025-03-04 14:41:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655958178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793079023] [2025-03-04 14:41:40,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:40,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:40,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:40,240 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:41:40,242 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:41:41,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:41:41,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:41:41,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:41,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:41,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:41,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:41,306 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:41:41,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:41,347 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:41:41,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793079023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:41,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:41,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:41:41,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544141107] [2025-03-04 14:41:41,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:41,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:41:41,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:41,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:41:41,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:41,348 INFO L87 Difference]: Start difference. First operand 408 states and 551 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:41:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:41,423 INFO L93 Difference]: Finished difference Result 791 states and 1079 transitions. [2025-03-04 14:41:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:41,424 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:41:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:41,426 INFO L225 Difference]: With dead ends: 791 [2025-03-04 14:41:41,426 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 14:41:41,427 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:41:41,428 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 4 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:41,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 999 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 14:41:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-04 14:41:41,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 381 states have internal predecessors, (502), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 569 transitions. [2025-03-04 14:41:41,438 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 569 transitions. Word has length 55 [2025-03-04 14:41:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:41,438 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 569 transitions. [2025-03-04 14:41:41,438 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:41:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 569 transitions. [2025-03-04 14:41:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 14:41:41,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:41,439 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:41,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:41,640 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 777362016, now seen corresponding path program 1 times [2025-03-04 14:41:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931549754] [2025-03-04 14:41:41,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:42,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:41:42,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:41:42,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:42,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931549754] [2025-03-04 14:41:42,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931549754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056612247] [2025-03-04 14:41:42,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:42,334 INFO L229 MonitoredProcess]: Starting monitored process 8 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:41:42,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:41:43,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:41:43,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:41:43,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:43,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:41:43,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:41:43,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:43,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056612247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:43,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 14:41:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922831379] [2025-03-04 14:41:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:43,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:41:43,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:43,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:41:43,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:43,520 INFO L87 Difference]: Start difference. First operand 426 states and 569 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:41:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:43,684 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2025-03-04 14:41:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:41:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 56 [2025-03-04 14:41:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:43,687 INFO L225 Difference]: With dead ends: 546 [2025-03-04 14:41:43,687 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 14:41:43,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:43,688 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 140 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:43,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1625 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 14:41:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2025-03-04 14:41:43,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 466 states have (on average 1.3626609442060085) internal successors, (635), 476 states have internal predecessors, (635), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 14:41:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 723 transitions. [2025-03-04 14:41:43,701 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 723 transitions. Word has length 56 [2025-03-04 14:41:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:43,701 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 723 transitions. [2025-03-04 14:41:43,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:41:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 723 transitions. [2025-03-04 14:41:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:41:43,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:43,702 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:43,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:43,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1338035313, now seen corresponding path program 1 times [2025-03-04 14:41:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838720283] [2025-03-04 14:41:43,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:44,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:41:44,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:41:44,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:44,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:44,531 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:41:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838720283] [2025-03-04 14:41:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838720283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:41:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656437314] [2025-03-04 14:41:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:44,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:41:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:44,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:41:44,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:44,532 INFO L87 Difference]: Start difference. First operand 530 states and 723 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:44,658 INFO L93 Difference]: Finished difference Result 546 states and 738 transitions. [2025-03-04 14:41:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 14:41:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:44,660 INFO L225 Difference]: With dead ends: 546 [2025-03-04 14:41:44,660 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 14:41:44,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:41:44,661 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 17 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:44,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2487 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 14:41:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2025-03-04 14:41:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 473 states have (on average 1.3594080338266386) internal successors, (643), 483 states have internal predecessors, (643), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 14:41:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 733 transitions. [2025-03-04 14:41:44,674 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 733 transitions. Word has length 58 [2025-03-04 14:41:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:44,675 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 733 transitions. [2025-03-04 14:41:44,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 733 transitions. [2025-03-04 14:41:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:41:44,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:44,675 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:44,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:41:44,676 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1338034352, now seen corresponding path program 1 times [2025-03-04 14:41:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918442791] [2025-03-04 14:41:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:44,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:45,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:41:45,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:41:45,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:45,495 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:41:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918442791] [2025-03-04 14:41:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918442791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:45,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:41:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891458445] [2025-03-04 14:41:45,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:45,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:41:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:45,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:41:45,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:45,497 INFO L87 Difference]: Start difference. First operand 540 states and 733 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:45,694 INFO L93 Difference]: Finished difference Result 785 states and 1060 transitions. [2025-03-04 14:41:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:45,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 14:41:45,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:45,696 INFO L225 Difference]: With dead ends: 785 [2025-03-04 14:41:45,697 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 14:41:45,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:45,698 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 164 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:45,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 2273 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:41:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 14:41:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-04 14:41:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 388 states have internal predecessors, (509), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:41:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 578 transitions. [2025-03-04 14:41:45,708 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 578 transitions. Word has length 58 [2025-03-04 14:41:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:45,708 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 578 transitions. [2025-03-04 14:41:45,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 578 transitions. [2025-03-04 14:41:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 14:41:45,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:45,709 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:45,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:41:45,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:45,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 391912472, now seen corresponding path program 1 times [2025-03-04 14:41:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394136957] [2025-03-04 14:41:45,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:46,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:41:46,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:41:46,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:46,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:41:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394136957] [2025-03-04 14:41:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394136957] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:46,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422508356] [2025-03-04 14:41:46,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:46,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:46,353 INFO L229 MonitoredProcess]: Starting monitored process 9 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:41:46,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:41:47,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:41:47,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:41:47,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:47,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:41:47,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:47,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422508356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:47,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:41:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505418483] [2025-03-04 14:41:47,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:41:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:47,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:41:47,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:47,734 INFO L87 Difference]: Start difference. First operand 436 states and 578 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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:41:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:47,936 INFO L93 Difference]: Finished difference Result 855 states and 1149 transitions. [2025-03-04 14:41:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:41:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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 72 [2025-03-04 14:41:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:47,938 INFO L225 Difference]: With dead ends: 855 [2025-03-04 14:41:47,938 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 14:41:47,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:47,940 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 5 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2963 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:47,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2963 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:41:47,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 14:41:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-04 14:41:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 416 states have (on average 1.3076923076923077) internal successors, (544), 423 states have internal predecessors, (544), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:41:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 613 transitions. [2025-03-04 14:41:47,951 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 613 transitions. Word has length 72 [2025-03-04 14:41:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:47,951 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 613 transitions. [2025-03-04 14:41:47,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 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:41:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 613 transitions. [2025-03-04 14:41:47,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 14:41:47,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:47,952 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:47,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:48,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:41:48,153 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:41:48,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash -266847608, now seen corresponding path program 1 times [2025-03-04 14:41:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:48,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417402067] [2025-03-04 14:41:48,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:48,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:41:48,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:41:48,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:48,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:41:48,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:41:48,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:41:49,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:41:49,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:49,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:41:49,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:41:49,171 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:41:49,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE (51 of 52 remaining) [2025-03-04 14:41:49,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-03-04 14:41:49,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-03-04 14:41:49,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-03-04 14:41:49,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-03-04 14:41:49,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (42 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-03-04 14:41:49,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-03-04 14:41:49,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-03-04 14:41:49,176 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-03-04 14:41:49,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-03-04 14:41:49,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:41:49,179 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:49,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:41:49,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:41:49 BoogieIcfgContainer [2025-03-04 14:41:49,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:41:49,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:41:49,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:41:49,283 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:41:49,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24" (3/4) ... [2025-03-04 14:41:49,285 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:41:49,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:41:49,286 INFO L158 Benchmark]: Toolchain (without parser) took 32106.10ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 149.9MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,286 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:41:49,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1023.42ms. Allocated memory is still 201.3MB. Free memory was 149.6MB in the beginning and 135.8MB in the end (delta: 13.8MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.95ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 122.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,287 INFO L158 Benchmark]: Boogie Preprocessor took 137.82ms. Allocated memory is still 201.3MB. Free memory was 122.0MB in the beginning and 109.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,288 INFO L158 Benchmark]: IcfgBuilder took 5687.88ms. Allocated memory is still 201.3MB. Free memory was 109.5MB in the beginning and 64.6MB in the end (delta: 44.9MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,289 INFO L158 Benchmark]: TraceAbstraction took 25157.08ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 63.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 751.6MB. Max. memory is 16.1GB. [2025-03-04 14:41:49,290 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 224.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:41:49,290 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1023.42ms. Allocated memory is still 201.3MB. Free memory was 149.6MB in the beginning and 135.8MB in the end (delta: 13.8MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.95ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 122.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 137.82ms. Allocated memory is still 201.3MB. Free memory was 122.0MB in the beginning and 109.5MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5687.88ms. Allocated memory is still 201.3MB. Free memory was 109.5MB in the beginning and 64.6MB in the end (delta: 44.9MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25157.08ms. Allocated memory was 201.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 63.4MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 751.6MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 1.7GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 224.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1135]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of undefined function vasprintf at line 1135. Possible FailurePath: [L2370] static const char *applet_name; [L2371] static signed int bb_errno_location; [L2372] static signed int * const bb_errno = &bb_errno_location; [L2373] static const char bb_msg_memory_exhausted[14l] = { (const char)111, (const char)117, (const char)116, (const char)32, (const char)111, (const char)102, (const char)32, (const char)109, (const char)101, (const char)109, (const char)111, (const char)114, (const char)121, (const char)0 }; [L2374] static struct __jmp_buf_tag die_jmp[1l]; [L2375] static signed int die_sleep; [L2376] static char local_buf[(signed long int)(sizeof(signed int) * 3) ]; [L2377] static signed char logmode = (signed char)1; [L2378] static const char *msg_eol = "\n"; [L2379] static unsigned char xfunc_error_retval = (unsigned char)1; [L2445] static const char charmap[20l] = { (const char)97, (const char)98, (const char)101, (const char)102, (const char)110, (const char)114, (const char)116, (const char)118, (const char)92, (const char)0, (const char)7, (const char)8, (const char)27, (const char)12, (const char)10, (const char)13, (const char)9, (const char)11, (const char)92, (const char)92 }; [L3133] static const char format_chars[14l] = { (const char)100, (const char)105, (const char)111, (const char)117, (const char)120, (const char)88, (const char)102, (const char)101, (const char)69, (const char)103, (const char)71, (const char)99, (const char)115, (const char)0 }; [L3336] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3399] char *a = malloc(11); [L3400] a[10] = 0 [L3401] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=1, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=2, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=3, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=4, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=5, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=6, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=7, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=8, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND TRUE i<10 [L3402] a[i]=__VERIFIER_nondet_char() VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=9, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=10, local_buf={14:0}, logmode=1, msg_eol={3:0}, xfunc_error_retval=1] [L3401] COND FALSE !(i<10) [L3403] applet_name = a [L3404] bb_errno_location = __VERIFIER_nondet_int() [L3405] optind = 1 [L3406] int argc = __VERIFIER_nondet_int(); [L3407] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3407] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, local_buf={14:0}, logmode=1, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3408] EXPR argc+1 [L3408] char **argv=malloc((argc+1)*sizeof(char*)); [L3409] EXPR argc+1 [L3409] char **mem_track=malloc((argc+1)*sizeof(char*)); [L3410] argv[argc]=0 [L3411] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={12:0}, bb_errno_location={12:0}, bb_msg_memory_exhausted={13:0}, charmap={15:0}, die_sleep=0, dummy_utmp={17:0}, format_chars={16:0}, i=0, local_buf={14:0}, logmode=1, mem_track={-14:0}, msg_eol={3:0}, optind=1, xfunc_error_retval=1] [L3411] COND TRUE i 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 -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-03-04 14:41:51,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:41:51,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:41:51,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:41:51,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:41:51,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:41:51,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-03-04 14:41:52,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49204f5bc/55562ba189d942f8a4b345cab32edf7f/FLAGac3b2747a [2025-03-04 14:41:53,004 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:41:53,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-03-04 14:41:53,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49204f5bc/55562ba189d942f8a4b345cab32edf7f/FLAGac3b2747a [2025-03-04 14:41:53,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49204f5bc/55562ba189d942f8a4b345cab32edf7f [2025-03-04 14:41:53,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:41:53,212 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:41:53,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:53,213 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:41:53,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:41:53,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:53" (1/1) ... [2025-03-04 14:41:53,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe88d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:53, skipping insertion in model container [2025-03-04 14:41:53,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:53" (1/1) ... [2025-03-04 14:41:53,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:41:53,881 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,882 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,890 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,893 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,895 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,896 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,897 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,898 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,899 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,899 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,900 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,900 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,901 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,902 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,903 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,904 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,904 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,905 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,906 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,906 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,907 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,907 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,908 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,909 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,909 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,910 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,914 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,917 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,919 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,919 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,922 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,923 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,924 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,925 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,926 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,928 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,930 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,931 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,936 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,939 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,939 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,939 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,940 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,940 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,941 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,947 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,950 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,951 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,952 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,954 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,956 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,956 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,957 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,958 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,958 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,959 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,964 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,965 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,966 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,973 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,986 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:53,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:54,025 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:41:54,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:54,292 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:41:54,300 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:41:54,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54 WrapperNode [2025-03-04 14:41:54,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:54,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:54,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:41:54,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:41:54,305 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:41:54" (1/1) ... [2025-03-04 14:41:54,344 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:41:54" (1/1) ... [2025-03-04 14:41:54,421 INFO L138 Inliner]: procedures = 663, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1811 [2025-03-04 14:41:54,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:54,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:41:54,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:41:54,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:41:54,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,460 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:41:54,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:41:54,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:41:54,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:41:54,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:41:54,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (1/1) ... [2025-03-04 14:41:54,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:54,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:54,611 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:41:54,614 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:41:54,633 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-04 14:41:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-04 14:41:54,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-04 14:41:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:41:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-04 14:41:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2025-03-04 14:41:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-04 14:41:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-04 14:41:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-04 14:41:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intFLOATTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-04 14:41:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-04 14:41:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-04 14:41:55,008 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:41:55,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:41:55,101 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-04 14:41:55,395 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-04 14:41:55,443 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-04 14:41:55,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem159#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-04 14:41:55,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-04 14:41:55,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem161#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-04 14:41:55,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem163#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-04 14:42:01,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem307#1;havoc __main_#t~short308#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-04 14:42:01,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-04 14:42:01,656 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-04 14:42:01,774 INFO L? ?]: Removed 608 outVars from TransFormulas that were not future-live. [2025-03-04 14:42:01,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:42:01,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:42:01,794 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:42:01,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:01 BoogieIcfgContainer [2025-03-04 14:42:01,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:42:01,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:42:01,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:42:01,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:42:01,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:41:53" (1/3) ... [2025-03-04 14:42:01,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17440e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:01, skipping insertion in model container [2025-03-04 14:42:01,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:54" (2/3) ... [2025-03-04 14:42:01,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17440e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:01, skipping insertion in model container [2025-03-04 14:42:01,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:01" (3/3) ... [2025-03-04 14:42:01,801 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-03-04 14:42:01,811 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:42:01,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 491 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-03-04 14:42:01,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:42:01,874 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;@35b4f321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:42:01,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-03-04 14:42:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 491 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 439 states have internal predecessors, (589), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 14:42:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:42:01,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:01,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:42:01,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:01,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 23856575, now seen corresponding path program 1 times [2025-03-04 14:42:01,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:01,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803235121] [2025-03-04 14:42:01,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:01,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:01,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:01,901 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:42:01,903 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:42:02,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:42:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:42:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:03,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:42:03,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:03,039 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:42:03,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:03,039 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803235121] [2025-03-04 14:42:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803235121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:42:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352520424] [2025-03-04 14:42:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:03,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:42:03,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:03,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:42:03,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:42:03,056 INFO L87 Difference]: Start difference. First operand has 491 states, 372 states have (on average 1.5833333333333333) internal successors, (589), 439 states have internal predecessors, (589), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:42:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:03,113 INFO L93 Difference]: Finished difference Result 857 states and 1272 transitions. [2025-03-04 14:42:03,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:42:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:42:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:03,125 INFO L225 Difference]: With dead ends: 857 [2025-03-04 14:42:03,125 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 14:42:03,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:42:03,135 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:03,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:42:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 14:42:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 14:42:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 301 states have (on average 1.4019933554817277) internal successors, (422), 309 states have internal predecessors, (422), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2025-03-04 14:42:03,192 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 4 [2025-03-04 14:42:03,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:03,192 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2025-03-04 14:42:03,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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:42:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2025-03-04 14:42:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:42:03,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:03,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:42:03,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:42:03,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:03,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:03,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:03,394 INFO L85 PathProgramCache]: Analyzing trace with hash 739554534, now seen corresponding path program 1 times [2025-03-04 14:42:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:03,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103409371] [2025-03-04 14:42:03,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:03,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:03,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:03,398 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:42:03,399 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:42:03,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:42:04,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:42:04,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:04,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:04,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:04,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:04,946 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:42:04,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:04,946 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:04,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103409371] [2025-03-04 14:42:04,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103409371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:04,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:04,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:04,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147055854] [2025-03-04 14:42:04,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:04,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:04,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:04,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:04,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:04,948 INFO L87 Difference]: Start difference. First operand 354 states and 489 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:42:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:05,345 INFO L93 Difference]: Finished difference Result 706 states and 976 transitions. [2025-03-04 14:42:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:05,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 14:42:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:05,351 INFO L225 Difference]: With dead ends: 706 [2025-03-04 14:42:05,351 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 14:42:05,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:05,352 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:05,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:42:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 14:42:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-04 14:42:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.3980263157894737) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-04 14:42:05,380 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 5 [2025-03-04 14:42:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:05,380 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-04 14:42:05,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:42:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-04 14:42:05,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:42:05,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:05,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:42:05,409 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:42:05,581 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 [2025-03-04 14:42:05,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:05,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1112398143, now seen corresponding path program 1 times [2025-03-04 14:42:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936456619] [2025-03-04 14:42:05,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:05,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:05,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:42:05,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:42:06,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:42:06,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:42:06,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:06,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:06,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:06,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:07,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:08,506 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:08,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936456619] [2025-03-04 14:42:08,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936456619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:08,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:42:08,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:42:08,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218854243] [2025-03-04 14:42:08,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:08,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:08,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:08,507 INFO L87 Difference]: Start difference. First operand 357 states and 492 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:42:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:09,615 INFO L93 Difference]: Finished difference Result 709 states and 981 transitions. [2025-03-04 14:42:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:42:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:09,618 INFO L225 Difference]: With dead ends: 709 [2025-03-04 14:42:09,618 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 14:42:09,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:09,619 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:09,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 14:42:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 14:42:09,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-04 14:42:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 305 states have (on average 1.3934426229508197) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-04 14:42:09,646 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 8 [2025-03-04 14:42:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:09,646 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-04 14:42:09,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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:42:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-04 14:42:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:42:09,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:09,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:09,679 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:42:09,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:09,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:09,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2129948287, now seen corresponding path program 1 times [2025-03-04 14:42:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122186797] [2025-03-04 14:42:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:09,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:09,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:09,851 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:42:09,852 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:42:10,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:42:10,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:42:10,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:10,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:10,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:42:10,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:12,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:12,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122186797] [2025-03-04 14:42:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122186797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:12,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:12,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:42:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012799164] [2025-03-04 14:42:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:42:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:12,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:42:12,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:12,127 INFO L87 Difference]: Start difference. First operand 357 states and 492 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:42:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:13,744 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2025-03-04 14:42:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:42:13,746 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 16 [2025-03-04 14:42:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:13,748 INFO L225 Difference]: With dead ends: 357 [2025-03-04 14:42:13,748 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 14:42:13,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:13,748 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 148 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:13,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1743 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 14:42:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 14:42:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 14:42:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 305 states have (on average 1.3868852459016394) internal successors, (423), 310 states have internal predecessors, (423), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 490 transitions. [2025-03-04 14:42:13,758 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 490 transitions. Word has length 16 [2025-03-04 14:42:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:13,759 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 490 transitions. [2025-03-04 14:42:13,759 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:42:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 490 transitions. [2025-03-04 14:42:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:42:13,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:13,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:13,791 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:42:13,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:13,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:13,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2006479573, now seen corresponding path program 1 times [2025-03-04 14:42:13,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:13,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695519237] [2025-03-04 14:42:13,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:13,964 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:42:13,965 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:42:14,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:42:14,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:42:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:14,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:14,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:15,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:15,454 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695519237] [2025-03-04 14:42:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695519237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065793623] [2025-03-04 14:42:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:15,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:15,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:15,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:15,455 INFO L87 Difference]: Start difference. First operand 355 states and 490 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:16,064 INFO L93 Difference]: Finished difference Result 363 states and 500 transitions. [2025-03-04 14:42:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:16,067 INFO L225 Difference]: With dead ends: 363 [2025-03-04 14:42:16,068 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 14:42:16,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:16,068 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:16,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 959 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:42:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 14:42:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2025-03-04 14:42:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 311 states have (on average 1.3890675241157557) internal successors, (432), 316 states have internal predecessors, (432), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 499 transitions. [2025-03-04 14:42:16,083 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 499 transitions. Word has length 22 [2025-03-04 14:42:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:16,083 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 499 transitions. [2025-03-04 14:42:16,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2025-03-04 14:42:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:42:16,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:16,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:16,115 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:42:16,284 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 [2025-03-04 14:42:16,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:16,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2006484538, now seen corresponding path program 1 times [2025-03-04 14:42:16,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310311013] [2025-03-04 14:42:16,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:16,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:16,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:16,287 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:42:16,288 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:42:16,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:42:17,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:42:17,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:17,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:17,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:17,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:17,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:17,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310311013] [2025-03-04 14:42:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310311013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:17,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352264672] [2025-03-04 14:42:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:17,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:17,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:17,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:17,752 INFO L87 Difference]: Start difference. First operand 361 states and 499 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:18,132 INFO L93 Difference]: Finished difference Result 710 states and 985 transitions. [2025-03-04 14:42:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:18,135 INFO L225 Difference]: With dead ends: 710 [2025-03-04 14:42:18,135 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 14:42:18,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:18,137 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:18,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:42:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 14:42:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-04 14:42:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 317 states have (on average 1.3817034700315458) internal successors, (438), 322 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-03-04 14:42:18,150 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 22 [2025-03-04 14:42:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:18,151 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-03-04 14:42:18,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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:42:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-03-04 14:42:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:42:18,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:18,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:18,189 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:42:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:18,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2121705181, now seen corresponding path program 1 times [2025-03-04 14:42:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:18,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799835259] [2025-03-04 14:42:18,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:18,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:18,356 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42:18,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:42:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:42:19,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:42:19,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:19,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:19,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:19,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:20,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:21,529 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:21,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799835259] [2025-03-04 14:42:21,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799835259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:21,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:42:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:42:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156874397] [2025-03-04 14:42:21,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:21,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:21,530 INFO L87 Difference]: Start difference. First operand 367 states and 505 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:42:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:22,790 INFO L93 Difference]: Finished difference Result 720 states and 998 transitions. [2025-03-04 14:42:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:22,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-03-04 14:42:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:22,793 INFO L225 Difference]: With dead ends: 720 [2025-03-04 14:42:22,793 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 14:42:22,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:22,797 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:22,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1439 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 14:42:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 14:42:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2025-03-04 14:42:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 319 states have (on average 1.3730407523510972) internal successors, (438), 323 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 505 transitions. [2025-03-04 14:42:22,819 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 505 transitions. Word has length 25 [2025-03-04 14:42:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:22,820 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 505 transitions. [2025-03-04 14:42:22,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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:42:22,820 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 505 transitions. [2025-03-04 14:42:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 14:42:22,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:22,821 INFO L218 NwaCegarLoop]: trace histogram [2, 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:42:22,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:42:23,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:23,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:23,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1969824598, now seen corresponding path program 1 times [2025-03-04 14:42:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034975961] [2025-03-04 14:42:23,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:23,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:23,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:23,025 INFO L229 MonitoredProcess]: Starting monitored process 9 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:42:23,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:42:23,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 14:42:23,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 14:42:23,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:23,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:23,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:42:23,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:24,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:24,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:24,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034975961] [2025-03-04 14:42:24,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034975961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:24,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:24,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:42:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56482033] [2025-03-04 14:42:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:24,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:42:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:24,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:42:24,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:42:24,553 INFO L87 Difference]: Start difference. First operand 368 states and 505 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:42:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:25,006 INFO L93 Difference]: Finished difference Result 375 states and 513 transitions. [2025-03-04 14:42:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:42:25,007 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 26 [2025-03-04 14:42:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:25,009 INFO L225 Difference]: With dead ends: 375 [2025-03-04 14:42:25,009 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 14:42:25,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:42:25,009 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:25,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1443 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:42:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 14:42:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-04 14:42:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 321 states have (on average 1.3707165109034267) internal successors, (440), 325 states have internal predecessors, (440), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 507 transitions. [2025-03-04 14:42:25,025 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 507 transitions. Word has length 26 [2025-03-04 14:42:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:25,026 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 507 transitions. [2025-03-04 14:42:25,026 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:42:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 507 transitions. [2025-03-04 14:42:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:42:25,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:25,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:25,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:42:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:25,228 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 50438639, now seen corresponding path program 1 times [2025-03-04 14:42:25,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:25,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48524036] [2025-03-04 14:42:25,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:25,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:25,231 INFO L229 MonitoredProcess]: Starting monitored process 10 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:42:25,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:42:25,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:42:26,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:42:26,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:26,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:26,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:26,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:26,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48524036] [2025-03-04 14:42:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48524036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068686589] [2025-03-04 14:42:26,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:26,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:26,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:26,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:26,589 INFO L87 Difference]: Start difference. First operand 370 states and 507 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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:42:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:26,911 INFO L93 Difference]: Finished difference Result 374 states and 511 transitions. [2025-03-04 14:42:26,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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 30 [2025-03-04 14:42:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:26,915 INFO L225 Difference]: With dead ends: 374 [2025-03-04 14:42:26,915 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 14:42:26,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:26,916 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:26,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:42:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 14:42:26,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-04 14:42:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 324 states have (on average 1.367283950617284) internal successors, (443), 328 states have internal predecessors, (443), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 510 transitions. [2025-03-04 14:42:26,927 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 510 transitions. Word has length 30 [2025-03-04 14:42:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:26,928 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 510 transitions. [2025-03-04 14:42:26,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 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:42:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 510 transitions. [2025-03-04 14:42:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 14:42:26,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:26,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:26,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:42:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:27,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:27,132 INFO L85 PathProgramCache]: Analyzing trace with hash 654439036, now seen corresponding path program 1 times [2025-03-04 14:42:27,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035272922] [2025-03-04 14:42:27,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:27,134 INFO L229 MonitoredProcess]: Starting monitored process 11 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:42:27,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:42:27,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 14:42:28,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 14:42:28,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:28,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:42:28,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:29,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:29,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035272922] [2025-03-04 14:42:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035272922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:29,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:42:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085381564] [2025-03-04 14:42:29,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:29,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:29,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:29,739 INFO L87 Difference]: Start difference. First operand 373 states and 510 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:31,782 INFO L93 Difference]: Finished difference Result 389 states and 525 transitions. [2025-03-04 14:42:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:31,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 14:42:31,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:31,784 INFO L225 Difference]: With dead ends: 389 [2025-03-04 14:42:31,784 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 14:42:31,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:42:31,784 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 17 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:31,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2392 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 14:42:31,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 14:42:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2025-03-04 14:42:31,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 335 states have internal predecessors, (451), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:42:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 520 transitions. [2025-03-04 14:42:31,805 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 520 transitions. Word has length 34 [2025-03-04 14:42:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:31,806 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 520 transitions. [2025-03-04 14:42:31,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 520 transitions. [2025-03-04 14:42:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 14:42:31,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:31,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:31,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 14:42:32,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:32,007 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr27ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:32,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:32,008 INFO L85 PathProgramCache]: Analyzing trace with hash 654439997, now seen corresponding path program 1 times [2025-03-04 14:42:32,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:32,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850550936] [2025-03-04 14:42:32,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:32,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:32,010 INFO L229 MonitoredProcess]: Starting monitored process 12 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:42:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:42:32,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 14:42:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 14:42:32,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:32,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:33,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:42:33,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:35,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:35,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:35,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850550936] [2025-03-04 14:42:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850550936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:42:35,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49967198] [2025-03-04 14:42:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:35,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:35,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:35,519 INFO L87 Difference]: Start difference. First operand 383 states and 520 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:38,561 INFO L93 Difference]: Finished difference Result 731 states and 999 transitions. [2025-03-04 14:42:38,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:38,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 14:42:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:38,564 INFO L225 Difference]: With dead ends: 731 [2025-03-04 14:42:38,564 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 14:42:38,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:38,565 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 157 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:38,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1868 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 14:42:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 14:42:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-03-04 14:42:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 331 states have (on average 1.3595166163141994) internal successors, (450), 335 states have internal predecessors, (450), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:42:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2025-03-04 14:42:38,574 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 34 [2025-03-04 14:42:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:38,575 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2025-03-04 14:42:38,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2025-03-04 14:42:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:42:38,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:38,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:38,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:42:38,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:38,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-03-04 14:42:38,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1596249997, now seen corresponding path program 1 times [2025-03-04 14:42:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858941544] [2025-03-04 14:42:38,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:38,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:38,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:38,781 INFO L229 MonitoredProcess]: Starting monitored process 13 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:42:38,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:42:39,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:42:39,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:42:39,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:39,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:39,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:39,912 INFO L279 TraceCheckSpWp]: Computing forward predicates...