./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:03:55,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:03:55,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:03:55,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:03:55,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:03:55,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:03:55,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:03:55,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:03:55,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:03:55,132 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:03:55,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:03:55,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:03:55,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:03:55,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:03:55,134 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:03:55,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:03:55,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:03:55,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:03:55,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:03:55,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:03:55,136 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:03:55,136 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:03:55,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:55,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:55,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:55,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:55,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:55,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:03:55,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:03:55,138 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-01-10 06:03:55,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:03:55,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:03:55,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:03:55,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:03:55,395 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:03:55,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-01-10 06:03:56,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6d308e5/440105d299714e0aa4e30cf5e34bcc84/FLAG0d5188432 [2025-01-10 06:03:56,988 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:03:56,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-01-10 06:03:57,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6d308e5/440105d299714e0aa4e30cf5e34bcc84/FLAG0d5188432 [2025-01-10 06:03:57,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6d308e5/440105d299714e0aa4e30cf5e34bcc84 [2025-01-10 06:03:57,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:03:57,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:03:57,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:03:57,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:03:57,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:03:57,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:57" (1/1) ... [2025-01-10 06:03:57,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d63c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:57, skipping insertion in model container [2025-01-10 06:03:57,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:03:57" (1/1) ... [2025-01-10 06:03:57,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:03:57,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:03:57,972 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:03:58,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:03:58,276 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:03:58,282 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:03:58,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58 WrapperNode [2025-01-10 06:03:58,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:03:58,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:03:58,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:03:58,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:03:58,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,472 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1869 [2025-01-10 06:03:58,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:03:58,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:03:58,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:03:58,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:03:58,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,515 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:03:58,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:03:58,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:03:58,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:03:58,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:03:58,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (1/1) ... [2025-01-10 06:03:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:03:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:03:58,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:03:58,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:03:58,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-01-10 06:03:58,679 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-01-10 06:03:58,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:03:58,679 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:03:58,679 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:03:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:03:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:03:58,680 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-01-10 06:03:58,680 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:03:58,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:03:58,681 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:03:58,682 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-01-10 06:03:58,682 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-01-10 06:03:59,045 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:03:59,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:04,533 INFO L? ?]: Removed 636 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:04,534 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:04,558 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:04,561 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 06:04:04,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:04 BoogieIcfgContainer [2025-01-10 06:04:04,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:04,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:04,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:04,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:04,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:03:57" (1/3) ... [2025-01-10 06:04:04,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c08424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:04, skipping insertion in model container [2025-01-10 06:04:04,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:03:58" (2/3) ... [2025-01-10 06:04:04,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c08424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:04, skipping insertion in model container [2025-01-10 06:04:04,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:04" (3/3) ... [2025-01-10 06:04:04,573 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-01-10 06:04:04,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:04,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 502 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-01-10 06:04:04,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:04,661 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;@2ea2a1a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:04,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-10 06:04:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 502 states, 383 states have (on average 1.5926892950391645) internal successors, (610), 450 states have internal predecessors, (610), 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-01-10 06:04:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:04,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:04,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:04,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:04,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 28815940, now seen corresponding path program 1 times [2025-01-10 06:04:04,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:04,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197189752] [2025-01-10 06:04:04,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:05,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:05,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:05,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:05,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:05,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:05,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197189752] [2025-01-10 06:04:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197189752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:05,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:05,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084850274] [2025-01-10 06:04:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:05,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:05,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:05,910 INFO L87 Difference]: Start difference. First operand has 502 states, 383 states have (on average 1.5926892950391645) internal successors, (610), 450 states have internal predecessors, (610), 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-01-10 06:04:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:06,019 INFO L93 Difference]: Finished difference Result 890 states and 1327 transitions. [2025-01-10 06:04:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:06,022 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-01-10 06:04:06,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:06,029 INFO L225 Difference]: With dead ends: 890 [2025-01-10 06:04:06,029 INFO L226 Difference]: Without dead ends: 374 [2025-01-10 06:04:06,037 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-01-10 06:04:06,039 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:06,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1077 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-10 06:04:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-10 06:04:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 313 states have (on average 1.4313099041533546) 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-01-10 06:04:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 515 transitions. [2025-01-10 06:04:06,104 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 515 transitions. Word has length 4 [2025-01-10 06:04:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:06,104 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 515 transitions. [2025-01-10 06:04:06,104 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-01-10 06:04:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 515 transitions. [2025-01-10 06:04:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:04:06,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:06,105 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:04:06,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:04:06,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:06,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -536851408, now seen corresponding path program 1 times [2025-01-10 06:04:06,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:06,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140869825] [2025-01-10 06:04:06,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:06,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:06,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:06,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:06,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:06,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140869825] [2025-01-10 06:04:06,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140869825] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:06,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210823038] [2025-01-10 06:04:06,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:06,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:06,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:06,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:06,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:04:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:07,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:07,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:07,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:07,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:07,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:07,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210823038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492117450] [2025-01-10 06:04:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:07,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:07,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:07,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:07,942 INFO L87 Difference]: Start difference. First operand 374 states and 515 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-01-10 06:04:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:08,013 INFO L93 Difference]: Finished difference Result 374 states and 515 transitions. [2025-01-10 06:04:08,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:08,018 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-01-10 06:04:08,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:08,020 INFO L225 Difference]: With dead ends: 374 [2025-01-10 06:04:08,020 INFO L226 Difference]: Without dead ends: 373 [2025-01-10 06:04:08,021 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-01-10 06:04:08,021 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:08,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1516 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:08,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-01-10 06:04:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-01-10 06:04:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 313 states have (on average 1.428115015974441) internal successors, (447), 328 states have internal predecessors, (447), 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-01-10 06:04:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 514 transitions. [2025-01-10 06:04:08,045 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 514 transitions. Word has length 7 [2025-01-10 06:04:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:08,045 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 514 transitions. [2025-01-10 06:04:08,045 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-01-10 06:04:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 514 transitions. [2025-01-10 06:04:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:08,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:08,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:08,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:04:08,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:08,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash 537476482, now seen corresponding path program 1 times [2025-01-10 06:04:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934493678] [2025-01-10 06:04:08,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:08,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:08,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:08,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:08,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:09,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:09,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934493678] [2025-01-10 06:04:09,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934493678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:09,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632494751] [2025-01-10 06:04:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:09,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:09,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:09,035 INFO L87 Difference]: Start difference. First operand 373 states and 514 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-01-10 06:04:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:09,067 INFO L93 Difference]: Finished difference Result 373 states and 514 transitions. [2025-01-10 06:04:09,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:09,067 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-01-10 06:04:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:09,069 INFO L225 Difference]: With dead ends: 373 [2025-01-10 06:04:09,071 INFO L226 Difference]: Without dead ends: 372 [2025-01-10 06:04:09,071 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-01-10 06:04:09,072 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:09,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-10 06:04:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2025-01-10 06:04:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 311 states have (on average 1.427652733118971) internal successors, (444), 325 states have internal predecessors, (444), 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-01-10 06:04:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 511 transitions. [2025-01-10 06:04:09,094 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 511 transitions. Word has length 8 [2025-01-10 06:04:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 511 transitions. [2025-01-10 06:04:09,094 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-01-10 06:04:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 511 transitions. [2025-01-10 06:04:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:04:09,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:09,095 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:04:09,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -583409188, now seen corresponding path program 1 times [2025-01-10 06:04:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971369575] [2025-01-10 06:04:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:09,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:09,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:09,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:09,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971369575] [2025-01-10 06:04:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971369575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784071717] [2025-01-10 06:04:09,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:09,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:09,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:09,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:09,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:04:10,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:10,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:10,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:10,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:10,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:10,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:10,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:10,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784071717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:10,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:10,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:04:10,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78917390] [2025-01-10 06:04:10,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:10,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:10,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:10,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:10,636 INFO L87 Difference]: Start difference. First operand 370 states and 511 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-01-10 06:04:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:10,689 INFO L93 Difference]: Finished difference Result 370 states and 511 transitions. [2025-01-10 06:04:10,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:10,691 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-01-10 06:04:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:10,693 INFO L225 Difference]: With dead ends: 370 [2025-01-10 06:04:10,693 INFO L226 Difference]: Without dead ends: 368 [2025-01-10 06:04:10,693 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-01-10 06:04:10,694 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 162 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:10,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 829 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-10 06:04:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-01-10 06:04:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 311 states have (on average 1.4212218649517685) internal successors, (442), 323 states have internal predecessors, (442), 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-01-10 06:04:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 509 transitions. [2025-01-10 06:04:10,708 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 509 transitions. Word has length 12 [2025-01-10 06:04:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:10,709 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 509 transitions. [2025-01-10 06:04:10,709 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-01-10 06:04:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 509 transitions. [2025-01-10 06:04:10,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:04:10,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:10,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:10,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:04:10,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:10,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:10,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:10,911 INFO L85 PathProgramCache]: Analyzing trace with hash -905814691, now seen corresponding path program 1 times [2025-01-10 06:04:10,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:10,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796651445] [2025-01-10 06:04:10,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:10,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:11,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:11,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:11,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:11,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:11,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796651445] [2025-01-10 06:04:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796651445] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:11,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946715102] [2025-01-10 06:04:11,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:11,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:11,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:04:12,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:12,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:12,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:12,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:12,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:12,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:12,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:12,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946715102] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:12,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:12,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:12,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360226775] [2025-01-10 06:04:12,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:12,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:12,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:12,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:12,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:12,536 INFO L87 Difference]: Start difference. First operand 368 states and 509 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-01-10 06:04:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:12,607 INFO L93 Difference]: Finished difference Result 739 states and 1023 transitions. [2025-01-10 06:04:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:12,610 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-01-10 06:04:12,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:12,612 INFO L225 Difference]: With dead ends: 739 [2025-01-10 06:04:12,612 INFO L226 Difference]: Without dead ends: 377 [2025-01-10 06:04:12,613 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-01-10 06:04:12,614 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 4 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:12,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2014 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-10 06:04:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-01-10 06:04:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 320 states have (on average 1.409375) 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-01-10 06:04:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 518 transitions. [2025-01-10 06:04:12,626 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 518 transitions. Word has length 13 [2025-01-10 06:04:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:12,627 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 518 transitions. [2025-01-10 06:04:12,627 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-01-10 06:04:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 518 transitions. [2025-01-10 06:04:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:12,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:12,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:12,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:12,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1607079281, now seen corresponding path program 2 times [2025-01-10 06:04:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866262860] [2025-01-10 06:04:12,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:12,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:13,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:04:13,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:04:13,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:13,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:13,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866262860] [2025-01-10 06:04:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866262860] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:13,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565884785] [2025-01-10 06:04:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:13,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:13,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:13,561 INFO L87 Difference]: Start difference. First operand 377 states and 518 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-01-10 06:04:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:13,668 INFO L93 Difference]: Finished difference Result 377 states and 518 transitions. [2025-01-10 06:04:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:13,670 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-01-10 06:04:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:13,672 INFO L225 Difference]: With dead ends: 377 [2025-01-10 06:04:13,672 INFO L226 Difference]: Without dead ends: 375 [2025-01-10 06:04:13,672 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-01-10 06:04:13,673 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 161 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:13,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1810 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-10 06:04:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-10 06:04:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 320 states have (on average 1.403125) internal successors, (449), 330 states have internal predecessors, (449), 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-01-10 06:04:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 516 transitions. [2025-01-10 06:04:13,683 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 516 transitions. Word has length 22 [2025-01-10 06:04:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 516 transitions. [2025-01-10 06:04:13,683 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-01-10 06:04:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 516 transitions. [2025-01-10 06:04:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:04:13,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:13,684 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:13,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:04:13,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:13,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1151209808, now seen corresponding path program 1 times [2025-01-10 06:04:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:13,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571628429] [2025-01-10 06:04:13,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:14,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:04:14,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:04:14,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:14,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571628429] [2025-01-10 06:04:14,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571628429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:14,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:14,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524405733] [2025-01-10 06:04:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:14,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:14,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:14,296 INFO L87 Difference]: Start difference. First operand 375 states and 516 transitions. Second operand has 3 states, 2 states have (on average 8.0) 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-01-10 06:04:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:14,334 INFO L93 Difference]: Finished difference Result 733 states and 1016 transitions. [2025-01-10 06:04:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) 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-01-10 06:04:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:14,337 INFO L225 Difference]: With dead ends: 733 [2025-01-10 06:04:14,337 INFO L226 Difference]: Without dead ends: 378 [2025-01-10 06:04:14,337 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-01-10 06:04:14,338 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:14,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1001 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-01-10 06:04:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-01-10 06:04:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 323 states have (on average 1.3993808049535603) 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-01-10 06:04:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 519 transitions. [2025-01-10 06:04:14,347 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 519 transitions. Word has length 27 [2025-01-10 06:04:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:14,347 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 519 transitions. [2025-01-10 06:04:14,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) 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-01-10 06:04:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 519 transitions. [2025-01-10 06:04:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:14,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:14,348 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-01-10 06:04:14,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:04:14,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:14,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash -376569477, now seen corresponding path program 1 times [2025-01-10 06:04:14,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:14,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818449891] [2025-01-10 06:04:14,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:14,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:14,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:14,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:14,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:14,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:15,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818449891] [2025-01-10 06:04:15,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818449891] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:15,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515854597] [2025-01-10 06:04:15,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:15,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:15,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:15,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:04:15,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:15,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:15,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:15,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:15,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:16,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:16,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515854597] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:16,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:16,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133596398] [2025-01-10 06:04:16,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:16,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:16,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:16,203 INFO L87 Difference]: Start difference. First operand 378 states and 519 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-01-10 06:04:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:16,426 INFO L93 Difference]: Finished difference Result 758 states and 1046 transitions. [2025-01-10 06:04:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:04:16,428 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-01-10 06:04:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:16,430 INFO L225 Difference]: With dead ends: 758 [2025-01-10 06:04:16,431 INFO L226 Difference]: Without dead ends: 395 [2025-01-10 06:04:16,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:16,433 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 5 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:16,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2972 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-01-10 06:04:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-01-10 06:04:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 341 states have (on average 1.3753665689149561) internal successors, (469), 350 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-01-10 06:04:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 536 transitions. [2025-01-10 06:04:16,453 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 536 transitions. Word has length 30 [2025-01-10 06:04:16,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:16,453 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 536 transitions. [2025-01-10 06:04:16,454 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-01-10 06:04:16,454 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 536 transitions. [2025-01-10 06:04:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:04:16,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,454 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] [2025-01-10 06:04:16,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:04:16,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-10 06:04:16,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 167377851, now seen corresponding path program 1 times [2025-01-10 06:04:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036667353] [2025-01-10 06:04:16,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:17,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:04:17,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:04:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:17,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036667353] [2025-01-10 06:04:17,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036667353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:17,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:17,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:17,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002310977] [2025-01-10 06:04:17,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:17,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:17,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:17,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,241 INFO L87 Difference]: Start difference. First operand 395 states and 536 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-01-10 06:04:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,291 INFO L93 Difference]: Finished difference Result 407 states and 550 transitions. [2025-01-10 06:04:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:17,292 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 48 [2025-01-10 06:04:17,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,293 INFO L225 Difference]: With dead ends: 407 [2025-01-10 06:04:17,293 INFO L226 Difference]: Without dead ends: 405 [2025-01-10 06:04:17,294 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-01-10 06:04:17,294 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 996 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-01-10 06:04:17,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 996 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-10 06:04:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 404. [2025-01-10 06:04:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 350 states have (on average 1.3742857142857143) internal successors, (481), 359 states have internal predecessors, (481), 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-01-10 06:04:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 548 transitions. [2025-01-10 06:04:17,305 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 548 transitions. Word has length 48 [2025-01-10 06:04:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 548 transitions. [2025-01-10 06:04:17,305 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-01-10 06:04:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 548 transitions. [2025-01-10 06:04:17,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:04:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,306 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-01-10 06:04:17,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:04:17,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1523577320, now seen corresponding path program 1 times [2025-01-10 06:04:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420434214] [2025-01-10 06:04:17,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:17,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:04:17,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:04:17,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420434214] [2025-01-10 06:04:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420434214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803038846] [2025-01-10 06:04:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:17,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:17,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,837 INFO L87 Difference]: Start difference. First operand 404 states and 548 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-01-10 06:04:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,865 INFO L93 Difference]: Finished difference Result 409 states and 553 transitions. [2025-01-10 06:04:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:17,866 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-01-10 06:04:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,868 INFO L225 Difference]: With dead ends: 409 [2025-01-10 06:04:17,868 INFO L226 Difference]: Without dead ends: 407 [2025-01-10 06:04:17,868 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-01-10 06:04:17,868 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1000 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:17,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1000 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-10 06:04:17,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-10 06:04:17,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 353 states have (on average 1.3711048158640227) internal successors, (484), 362 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-01-10 06:04:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 551 transitions. [2025-01-10 06:04:17,878 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 551 transitions. Word has length 49 [2025-01-10 06:04:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,879 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 551 transitions. [2025-01-10 06:04:17,879 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-01-10 06:04:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 551 transitions. [2025-01-10 06:04:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:04:17,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,879 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-01-10 06:04:17,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:04:17,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 893741102, now seen corresponding path program 1 times [2025-01-10 06:04:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256781987] [2025-01-10 06:04:17,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:18,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:04:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:04:18,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:18,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256781987] [2025-01-10 06:04:18,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256781987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:18,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:18,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060872313] [2025-01-10 06:04:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:18,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:18,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:18,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:18,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:18,405 INFO L87 Difference]: Start difference. First operand 407 states and 551 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-01-10 06:04:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:18,428 INFO L93 Difference]: Finished difference Result 407 states and 551 transitions. [2025-01-10 06:04:18,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:18,428 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-01-10 06:04:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:18,430 INFO L225 Difference]: With dead ends: 407 [2025-01-10 06:04:18,430 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 06:04:18,430 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-01-10 06:04:18,431 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:18,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:18,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 06:04:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 402. [2025-01-10 06:04:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 349 states have (on average 1.3696275071633237) internal successors, (478), 357 states have internal predecessors, (478), 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-01-10 06:04:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 545 transitions. [2025-01-10 06:04:18,440 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 545 transitions. Word has length 49 [2025-01-10 06:04:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:18,441 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 545 transitions. [2025-01-10 06:04:18,441 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-01-10 06:04:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 545 transitions. [2025-01-10 06:04:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 06:04:18,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:18,441 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-01-10 06:04:18,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:04:18,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash 323805285, now seen corresponding path program 1 times [2025-01-10 06:04:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:18,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539576002] [2025-01-10 06:04:18,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:18,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 06:04:18,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 06:04:18,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:19,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539576002] [2025-01-10 06:04:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539576002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038946383] [2025-01-10 06:04:19,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:19,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:19,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:04:19,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 06:04:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 06:04:20,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:20,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:20,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038946383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:20,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-01-10 06:04:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624498525] [2025-01-10 06:04:20,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:20,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:20,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:20,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:20,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:20,139 INFO L87 Difference]: Start difference. First operand 402 states and 545 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-01-10 06:04:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:20,171 INFO L93 Difference]: Finished difference Result 413 states and 557 transitions. [2025-01-10 06:04:20,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:20,172 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-01-10 06:04:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:20,174 INFO L225 Difference]: With dead ends: 413 [2025-01-10 06:04:20,174 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 06:04:20,174 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-01-10 06:04:20,175 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1500 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:20,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1500 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 06:04:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-01-10 06:04:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 351 states have (on average 1.3675213675213675) internal successors, (480), 359 states have internal predecessors, (480), 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-01-10 06:04:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 547 transitions. [2025-01-10 06:04:20,186 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 547 transitions. Word has length 52 [2025-01-10 06:04:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:20,187 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 547 transitions. [2025-01-10 06:04:20,187 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-01-10 06:04:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 547 transitions. [2025-01-10 06:04:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:04:20,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:20,189 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-01-10 06:04:20,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:04:20,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:04:20,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:20,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:20,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1006837852, now seen corresponding path program 1 times [2025-01-10 06:04:20,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:20,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842536469] [2025-01-10 06:04:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:20,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:20,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:20,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842536469] [2025-01-10 06:04:20,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842536469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:20,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908780383] [2025-01-10 06:04:20,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:20,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:20,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:04:21,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:22,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:22,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:22,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:22,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:22,120 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908780383] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:22,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213030402] [2025-01-10 06:04:22,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:22,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:22,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:22,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:22,121 INFO L87 Difference]: Start difference. First operand 404 states and 547 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-01-10 06:04:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:22,186 INFO L93 Difference]: Finished difference Result 783 states and 1071 transitions. [2025-01-10 06:04:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:22,187 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-01-10 06:04:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:22,189 INFO L225 Difference]: With dead ends: 783 [2025-01-10 06:04:22,189 INFO L226 Difference]: Without dead ends: 422 [2025-01-10 06:04:22,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:22,190 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:22,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1995 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-10 06:04:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-01-10 06:04:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 369 states have (on average 1.3495934959349594) internal successors, (498), 377 states have internal predecessors, (498), 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-01-10 06:04:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 565 transitions. [2025-01-10 06:04:22,204 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 565 transitions. Word has length 55 [2025-01-10 06:04:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:22,204 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 565 transitions. [2025-01-10 06:04:22,205 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-01-10 06:04:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 565 transitions. [2025-01-10 06:04:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 06:04:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:22,205 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-01-10 06:04:22,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:04:22,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:04:22,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:22,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:22,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1945857558, now seen corresponding path program 1 times [2025-01-10 06:04:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:22,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270821070] [2025-01-10 06:04:22,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:22,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:22,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 06:04:22,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 06:04:22,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:23,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270821070] [2025-01-10 06:04:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270821070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:23,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010594740] [2025-01-10 06:04:23,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:23,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:23,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:23,142 INFO L87 Difference]: Start difference. First operand 422 states and 565 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-01-10 06:04:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:23,231 INFO L93 Difference]: Finished difference Result 438 states and 580 transitions. [2025-01-10 06:04:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:23,232 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-01-10 06:04:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:23,233 INFO L225 Difference]: With dead ends: 438 [2025-01-10 06:04:23,233 INFO L226 Difference]: Without dead ends: 435 [2025-01-10 06:04:23,234 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-01-10 06:04:23,234 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 17 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2487 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-01-10 06:04:23,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2487 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-10 06:04:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2025-01-10 06:04:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 376 states have (on average 1.3457446808510638) internal successors, (506), 384 states have internal predecessors, (506), 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-01-10 06:04:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 575 transitions. [2025-01-10 06:04:23,251 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 575 transitions. Word has length 58 [2025-01-10 06:04:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 575 transitions. [2025-01-10 06:04:23,252 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-01-10 06:04:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 575 transitions. [2025-01-10 06:04:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 06:04:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:23,252 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-01-10 06:04:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:04:23,255 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:23,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1945859480, now seen corresponding path program 1 times [2025-01-10 06:04:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:23,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499335103] [2025-01-10 06:04:23,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:23,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 06:04:23,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 06:04:23,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:23,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499335103] [2025-01-10 06:04:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499335103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:24,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:24,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565915381] [2025-01-10 06:04:24,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:24,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:24,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:24,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:24,244 INFO L87 Difference]: Start difference. First operand 432 states and 575 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-01-10 06:04:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:24,561 INFO L93 Difference]: Finished difference Result 792 states and 1072 transitions. [2025-01-10 06:04:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:24,561 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-01-10 06:04:24,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:24,565 INFO L225 Difference]: With dead ends: 792 [2025-01-10 06:04:24,565 INFO L226 Difference]: Without dead ends: 432 [2025-01-10 06:04:24,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:24,569 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 163 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:24,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2272 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:04:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-10 06:04:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-10 06:04:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 376 states have (on average 1.3430851063829787) internal successors, (505), 384 states have internal predecessors, (505), 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-01-10 06:04:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 574 transitions. [2025-01-10 06:04:24,594 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 574 transitions. Word has length 58 [2025-01-10 06:04:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:24,594 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 574 transitions. [2025-01-10 06:04:24,594 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-01-10 06:04:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 574 transitions. [2025-01-10 06:04:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 06:04:24,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:24,595 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:04:24,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:04:24,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:24,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1285784796, now seen corresponding path program 1 times [2025-01-10 06:04:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:24,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497080566] [2025-01-10 06:04:24,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 06:04:25,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 06:04:25,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:25,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497080566] [2025-01-10 06:04:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497080566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:25,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728428638] [2025-01-10 06:04:25,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:25,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:25,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:25,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:04:26,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 06:04:26,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 06:04:26,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:26,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 2287 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:26,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:26,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728428638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:27,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-10 06:04:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314812910] [2025-01-10 06:04:27,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:04:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:27,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:04:27,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:04:27,064 INFO L87 Difference]: Start difference. First operand 432 states and 574 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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-01-10 06:04:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:27,189 INFO L93 Difference]: Finished difference Result 848 states and 1141 transitions. [2025-01-10 06:04:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:04:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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 74 [2025-01-10 06:04:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:27,192 INFO L225 Difference]: With dead ends: 848 [2025-01-10 06:04:27,192 INFO L226 Difference]: Without dead ends: 468 [2025-01-10 06:04:27,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:04:27,194 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:27,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1995 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-10 06:04:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-10 06:04:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 412 states have (on average 1.3131067961165048) internal successors, (541), 420 states have internal predecessors, (541), 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-01-10 06:04:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 610 transitions. [2025-01-10 06:04:27,209 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 610 transitions. Word has length 74 [2025-01-10 06:04:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:27,209 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 610 transitions. [2025-01-10 06:04:27,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 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-01-10 06:04:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 610 transitions. [2025-01-10 06:04:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-10 06:04:27,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:27,210 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-01-10 06:04:27,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:27,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:27,411 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:27,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:27,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1769724220, now seen corresponding path program 2 times [2025-01-10 06:04:27,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649316908] [2025-01-10 06:04:27,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:27,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 2 equivalence classes. [2025-01-10 06:04:28,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 06:04:28,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:28,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:04:28,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:04:28,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-10 06:04:28,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-10 06:04:28,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:28,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:04:28,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:04:28,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:04:28,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (51 of 52 remaining) [2025-01-10 06:04:28,670 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 52 remaining) [2025-01-10 06:04:28,671 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr25ASSERT_VIOLATIONUNSUPPORTED_FEATURE (20 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 52 remaining) [2025-01-10 06:04:28,672 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 52 remaining) [2025-01-10 06:04:28,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 52 remaining) [2025-01-10 06:04:28,674 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 52 remaining) [2025-01-10 06:04:28,675 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 52 remaining) [2025-01-10 06:04:28,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 52 remaining) [2025-01-10 06:04:28,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 52 remaining) [2025-01-10 06:04:28,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 52 remaining) [2025-01-10 06:04:28,676 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 52 remaining) [2025-01-10 06:04:28,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:04:28,679 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:28,765 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:04:28,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:04:28 BoogieIcfgContainer [2025-01-10 06:04:28,769 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:04:28,769 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:04:28,769 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:04:28,769 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:04:28,770 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:04" (3/4) ... [2025-01-10 06:04:28,771 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 06:04:28,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:04:28,773 INFO L158 Benchmark]: Toolchain (without parser) took 31736.99ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 103.6MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 326.3MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,773 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:04:28,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1248.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 51.1MB in the end (delta: 52.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 186.58ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 95.8MB in the end (delta: -44.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,774 INFO L158 Benchmark]: Boogie Preprocessor took 158.97ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.9MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,774 INFO L158 Benchmark]: RCFGBuilder took 5929.97ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 81.9MB in the beginning and 164.3MB in the end (delta: -82.4MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,774 INFO L158 Benchmark]: TraceAbstraction took 24204.23ms. Allocated memory was 335.5MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 163.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. [2025-01-10 06:04:28,775 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 148.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:04:28,776 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.69ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1248.14ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 51.1MB in the end (delta: 52.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 186.58ms. Allocated memory is still 142.6MB. Free memory was 51.1MB in the beginning and 95.8MB in the end (delta: -44.7MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.97ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 81.9MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 5929.97ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 81.9MB in the beginning and 164.3MB in the end (delta: -82.4MB). Peak memory consumption was 119.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24204.23ms. Allocated memory was 335.5MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 163.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 195.7MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.7GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 148.4kB). 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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331: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={331:0}, argc=1, argv={-12: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={-13: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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a2bb33d47b836fed611301f3ae383c62c561fece32293f145df9b8afe85841a [2025-01-10 06:04:31,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:04:31,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:04:31,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:04:31,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:04:31,200 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:04:31,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-01-10 06:04:32,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3eb27e9/51121e11146942f7bf4bb7808bd9137e/FLAGaa6ab277d [2025-01-10 06:04:32,804 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:04:32,805 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-1.i [2025-01-10 06:04:32,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3eb27e9/51121e11146942f7bf4bb7808bd9137e/FLAGaa6ab277d [2025-01-10 06:04:32,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd3eb27e9/51121e11146942f7bf4bb7808bd9137e [2025-01-10 06:04:32,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:04:32,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:04:32,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:32,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:04:32,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:04:32,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:32" (1/1) ... [2025-01-10 06:04:32,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595d0c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:32, skipping insertion in model container [2025-01-10 06:04:32,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:32" (1/1) ... [2025-01-10 06:04:32,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:04:33,685 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,686 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,701 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,705 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,708 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,713 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,713 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,714 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,714 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,715 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,717 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,718 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,719 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,720 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,721 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,721 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,731 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,732 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,740 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,741 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,742 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,768 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,769 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,772 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,772 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,772 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,773 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,773 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,773 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,786 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,787 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,787 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,792 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,795 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,797 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,797 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,797 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,798 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,799 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,800 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,805 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,806 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,807 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,812 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,823 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 06:04:33,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:33,857 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:04:33,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:34,123 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:04:34,139 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:04:34,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34 WrapperNode [2025-01-10 06:04:34,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:34,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:34,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:04:34,145 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:04:34,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,289 INFO L138 Inliner]: procedures = 663, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1811 [2025-01-10 06:04:34,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:34,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:04:34,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:04:34,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:04:34,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,322 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:04:34,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,419 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:04:34,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:04:34,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:04:34,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:04:34,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (1/1) ... [2025-01-10 06:04:34,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:34,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:04:34,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:04:34,561 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-01-10 06:04:34,561 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-01-10 06:04:34,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-01-10 06:04:34,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-01-10 06:04:34,562 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:04:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:04:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-01-10 06:04:34,563 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-01-10 06:04:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:04:34,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-01-10 06:04:34,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:04:34,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-01-10 06:04:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-01-10 06:04:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intFLOATTYPE8 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-01-10 06:04:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-01-10 06:04:34,566 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-01-10 06:04:34,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-01-10 06:04:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2025-01-10 06:04:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-01-10 06:04:34,568 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-01-10 06:04:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-01-10 06:04:34,568 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-01-10 06:04:34,997 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:04:34,998 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:45,399 INFO L? ?]: Removed 608 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:45,399 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:45,418 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:45,424 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-10 06:04:45,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:45 BoogieIcfgContainer [2025-01-10 06:04:45,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:45,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:45,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:45,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:45,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:04:32" (1/3) ... [2025-01-10 06:04:45,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4089bdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:45, skipping insertion in model container [2025-01-10 06:04:45,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:34" (2/3) ... [2025-01-10 06:04:45,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4089bdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:45, skipping insertion in model container [2025-01-10 06:04:45,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:45" (3/3) ... [2025-01-10 06:04:45,432 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-1.i [2025-01-10 06:04:45,443 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:45,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-1.i that has 15 procedures, 486 locations, 1 initial locations, 23 loop locations, and 52 error locations. [2025-01-10 06:04:45,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:45,511 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;@7fdb1fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:45,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2025-01-10 06:04:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 486 states, 367 states have (on average 1.5912806539509536) internal successors, (584), 434 states have internal predecessors, (584), 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-01-10 06:04:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:45,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:45,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:45,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 27707716, now seen corresponding path program 1 times [2025-01-10 06:04:45,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:45,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646010956] [2025-01-10 06:04:45,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:45,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:45,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:45,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:45,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:04:46,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:46,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:46,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:46,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 06:04:46,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:46,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:46,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646010956] [2025-01-10 06:04:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646010956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:46,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:04:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834717160] [2025-01-10 06:04:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:46,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:04:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:46,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:04:46,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:04:46,974 INFO L87 Difference]: Start difference. First operand has 486 states, 367 states have (on average 1.5912806539509536) internal successors, (584), 434 states have internal predecessors, (584), 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-01-10 06:04:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:47,030 INFO L93 Difference]: Finished difference Result 848 states and 1263 transitions. [2025-01-10 06:04:47,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:04:47,032 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-01-10 06:04:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:47,038 INFO L225 Difference]: With dead ends: 848 [2025-01-10 06:04:47,039 INFO L226 Difference]: Without dead ends: 350 [2025-01-10 06:04:47,044 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-01-10 06:04:47,046 INFO L435 NwaCegarLoop]: 517 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, 517 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-01-10 06:04:47,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-10 06:04:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-01-10 06:04:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 297 states have (on average 1.4074074074074074) internal successors, (418), 305 states have internal predecessors, (418), 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-01-10 06:04:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 485 transitions. [2025-01-10 06:04:47,095 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 485 transitions. Word has length 4 [2025-01-10 06:04:47,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:47,095 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 485 transitions. [2025-01-10 06:04:47,095 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-01-10 06:04:47,096 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 485 transitions. [2025-01-10 06:04:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:04:47,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:47,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:04:47,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:04:47,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:47,297 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:47,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash 858940106, now seen corresponding path program 1 times [2025-01-10 06:04:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1712119073] [2025-01-10 06:04:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:47,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:47,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:47,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:47,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:04:47,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:04:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:04:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:48,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:48,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:48,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:48,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:48,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712119073] [2025-01-10 06:04:48,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712119073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:48,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:48,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572334420] [2025-01-10 06:04:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:49,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:49,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:49,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:49,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:49,002 INFO L87 Difference]: Start difference. First operand 350 states and 485 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-01-10 06:04:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:49,410 INFO L93 Difference]: Finished difference Result 698 states and 968 transitions. [2025-01-10 06:04:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:49,412 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-01-10 06:04:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:49,415 INFO L225 Difference]: With dead ends: 698 [2025-01-10 06:04:49,415 INFO L226 Difference]: Without dead ends: 353 [2025-01-10 06:04:49,416 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-01-10 06:04:49,417 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 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-01-10 06:04:49,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:04:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-10 06:04:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2025-01-10 06:04:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 1.4033333333333333) internal successors, (421), 308 states have internal predecessors, (421), 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-01-10 06:04:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2025-01-10 06:04:49,438 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 5 [2025-01-10 06:04:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:49,438 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2025-01-10 06:04:49,438 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-01-10 06:04:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2025-01-10 06:04:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:49,439 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:49,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:04:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:49,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:49,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:49,641 INFO L85 PathProgramCache]: Analyzing trace with hash -729551998, now seen corresponding path program 1 times [2025-01-10 06:04:49,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:49,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371792833] [2025-01-10 06:04:49,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:49,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:49,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:49,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:49,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:04:50,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:50,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:50,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:50,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:50,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:51,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:52,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:52,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371792833] [2025-01-10 06:04:52,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371792833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:52,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:04:52,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:04:52,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193856530] [2025-01-10 06:04:52,752 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:52,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:52,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:52,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:52,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:52,753 INFO L87 Difference]: Start difference. First operand 353 states and 488 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-01-10 06:04:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:53,965 INFO L93 Difference]: Finished difference Result 701 states and 973 transitions. [2025-01-10 06:04:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:53,966 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-01-10 06:04:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:53,969 INFO L225 Difference]: With dead ends: 701 [2025-01-10 06:04:53,969 INFO L226 Difference]: Without dead ends: 356 [2025-01-10 06:04:53,970 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-01-10 06:04:53,971 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 0 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:53,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1917 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 06:04:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-10 06:04:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2025-01-10 06:04:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 301 states have (on average 1.398671096345515) internal successors, (421), 308 states have internal predecessors, (421), 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-01-10 06:04:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 488 transitions. [2025-01-10 06:04:53,998 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 488 transitions. Word has length 8 [2025-01-10 06:04:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:53,999 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 488 transitions. [2025-01-10 06:04:53,999 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-01-10 06:04:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 488 transitions. [2025-01-10 06:04:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 06:04:54,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:54,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:54,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:04:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:54,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1377703859, now seen corresponding path program 1 times [2025-01-10 06:04:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:54,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092276743] [2025-01-10 06:04:54,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:54,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:54,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:54,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:04:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:04:55,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:04:55,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:55,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:55,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:04:56,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:56,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:04:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092276743] [2025-01-10 06:04:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092276743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418237897] [2025-01-10 06:04:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:56,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:04:56,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:56,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:56,871 INFO L87 Difference]: Start difference. First operand 353 states and 488 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-01-10 06:04:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:58,696 INFO L93 Difference]: Finished difference Result 353 states and 488 transitions. [2025-01-10 06:04:58,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:58,697 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-01-10 06:04:58,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:58,703 INFO L225 Difference]: With dead ends: 353 [2025-01-10 06:04:58,703 INFO L226 Difference]: Without dead ends: 351 [2025-01-10 06:04:58,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:58,704 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 147 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1728 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.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:58,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1728 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-10 06:04:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-10 06:04:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-01-10 06:04:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 301 states have (on average 1.3920265780730896) internal successors, (419), 306 states have internal predecessors, (419), 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-01-10 06:04:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 486 transitions. [2025-01-10 06:04:58,719 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 486 transitions. Word has length 16 [2025-01-10 06:04:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:58,721 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 486 transitions. [2025-01-10 06:04:58,721 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-01-10 06:04:58,721 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2025-01-10 06:04:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:58,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:58,722 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-01-10 06:04:58,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:04:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:58,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:04:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -997783973, now seen corresponding path program 1 times [2025-01-10 06:04:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:04:58,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1075623624] [2025-01-10 06:04:58,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:58,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:58,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:58,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:04:59,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 06:05:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 06:05:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:00,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:00,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:05:00,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:00,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:00,588 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075623624] [2025-01-10 06:05:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075623624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:00,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:00,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300743795] [2025-01-10 06:05:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:00,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:00,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:00,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:00,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:00,590 INFO L87 Difference]: Start difference. First operand 351 states and 486 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-01-10 06:05:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:01,015 INFO L93 Difference]: Finished difference Result 691 states and 961 transitions. [2025-01-10 06:05:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:01,018 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-01-10 06:05:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:01,020 INFO L225 Difference]: With dead ends: 691 [2025-01-10 06:05:01,020 INFO L226 Difference]: Without dead ends: 354 [2025-01-10 06:05:01,023 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-01-10 06:05:01,023 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 954 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-01-10 06:05:01,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 954 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:05:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-10 06:05:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-01-10 06:05:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 304 states have (on average 1.388157894736842) 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-01-10 06:05:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2025-01-10 06:05:01,037 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 22 [2025-01-10 06:05:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:01,037 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2025-01-10 06:05:01,037 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-01-10 06:05:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2025-01-10 06:05:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-10 06:05:01,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:01,038 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-01-10 06:05:01,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:05:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:01,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:05:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash 487238536, now seen corresponding path program 1 times [2025-01-10 06:05:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:01,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963968270] [2025-01-10 06:05:01,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:01,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:01,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:01,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:01,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:05:01,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:05:02,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:05:02,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:02,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:05:02,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:03,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:05:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:04,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:04,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963968270] [2025-01-10 06:05:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963968270] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:05:04,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-10 06:05:04,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-01-10 06:05:04,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643522062] [2025-01-10 06:05:04,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-10 06:05:04,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:05:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:04,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:05:04,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:05:04,626 INFO L87 Difference]: Start difference. First operand 354 states and 489 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-01-10 06:05:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:06,077 INFO L93 Difference]: Finished difference Result 697 states and 969 transitions. [2025-01-10 06:05:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:06,080 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-01-10 06:05:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:06,082 INFO L225 Difference]: With dead ends: 697 [2025-01-10 06:05:06,082 INFO L226 Difference]: Without dead ends: 357 [2025-01-10 06:05:06,083 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-01-10 06:05:06,084 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 0 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:06,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2377 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 06:05:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-10 06:05:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 354. [2025-01-10 06:05:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.383606557377049) 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-01-10 06:05:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2025-01-10 06:05:06,109 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 25 [2025-01-10 06:05:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:06,110 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2025-01-10 06:05:06,110 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-01-10 06:05:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2025-01-10 06:05:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-10 06:05:06,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:06,110 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-01-10 06:05:06,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:05:06,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:06,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:05:06,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 296297413, now seen corresponding path program 1 times [2025-01-10 06:05:06,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:06,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573052743] [2025-01-10 06:05:06,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:06,317 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:05:06,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 06:05:07,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 06:05:07,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:07,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:07,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:05:07,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:08,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:08,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573052743] [2025-01-10 06:05:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573052743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:08,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:08,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:05:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567013903] [2025-01-10 06:05:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:08,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:05:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:08,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:05:08,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:05:08,088 INFO L87 Difference]: Start difference. First operand 354 states and 489 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-01-10 06:05:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:08,577 INFO L93 Difference]: Finished difference Result 361 states and 497 transitions. [2025-01-10 06:05:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:05:08,577 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-01-10 06:05:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:08,579 INFO L225 Difference]: With dead ends: 361 [2025-01-10 06:05:08,580 INFO L226 Difference]: Without dead ends: 356 [2025-01-10 06:05:08,580 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-01-10 06:05:08,580 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1431 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.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:08,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:05:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-01-10 06:05:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-01-10 06:05:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 307 states have (on average 1.3811074918566775) internal successors, (424), 311 states have internal predecessors, (424), 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-01-10 06:05:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 491 transitions. [2025-01-10 06:05:08,593 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 491 transitions. Word has length 26 [2025-01-10 06:05:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:08,593 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 491 transitions. [2025-01-10 06:05:08,593 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-01-10 06:05:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 491 transitions. [2025-01-10 06:05:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 06:05:08,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:08,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:05:08,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:05:08,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:08,795 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-01-10 06:05:08,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:08,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1665305983, now seen corresponding path program 1 times [2025-01-10 06:05:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:08,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566572648] [2025-01-10 06:05:08,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:08,798 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:08,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:05:09,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:05:09,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:05:09,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:09,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:09,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:05:09,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 06:05:10,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:10,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:10,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566572648] [2025-01-10 06:05:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566572648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:10,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:10,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184351598] [2025-01-10 06:05:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:10,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:10,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:10,771 INFO L87 Difference]: Start difference. First operand 356 states and 491 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-01-10 06:05:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:11,319 INFO L93 Difference]: Finished difference Result 367 states and 504 transitions. [2025-01-10 06:05:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:11,320 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 28 [2025-01-10 06:05:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:11,321 INFO L225 Difference]: With dead ends: 367 [2025-01-10 06:05:11,321 INFO L226 Difference]: Without dead ends: 366 [2025-01-10 06:05:11,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:11,322 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 949 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.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:11,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 949 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:05:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-10 06:05:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-01-10 06:05:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 317 states have (on average 1.3753943217665616) internal successors, (436), 321 states have internal predecessors, (436), 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-01-10 06:05:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 503 transitions. [2025-01-10 06:05:11,331 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 503 transitions. Word has length 28 [2025-01-10 06:05:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:11,332 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 503 transitions. [2025-01-10 06:05:11,332 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-01-10 06:05:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 503 transitions. [2025-01-10 06:05:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:05:11,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:11,332 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-01-10 06:05:11,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:05:11,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:11,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:05:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 633576048, now seen corresponding path program 1 times [2025-01-10 06:05:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623117276] [2025-01-10 06:05:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:11,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:11,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:11,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:11,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:05:12,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:05:12,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:05:12,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:12,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:05:12,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:12,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:12,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:12,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623117276] [2025-01-10 06:05:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623117276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:05:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558995736] [2025-01-10 06:05:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:05:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:12,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:05:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:12,949 INFO L87 Difference]: Start difference. First operand 366 states and 503 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-01-10 06:05:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:13,283 INFO L93 Difference]: Finished difference Result 370 states and 507 transitions. [2025-01-10 06:05:13,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:05:13,284 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-01-10 06:05:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:13,287 INFO L225 Difference]: With dead ends: 370 [2025-01-10 06:05:13,287 INFO L226 Difference]: Without dead ends: 369 [2025-01-10 06:05:13,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:05:13,288 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 953 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-01-10 06:05:13,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 953 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:05:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-10 06:05:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-01-10 06:05:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 320 states have (on average 1.371875) internal successors, (439), 324 states have internal predecessors, (439), 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-01-10 06:05:13,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 506 transitions. [2025-01-10 06:05:13,300 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 506 transitions. Word has length 30 [2025-01-10 06:05:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:13,300 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 506 transitions. [2025-01-10 06:05:13,301 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-01-10 06:05:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 506 transitions. [2025-01-10 06:05:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 06:05:13,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:13,304 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-01-10 06:05:13,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:05:13,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:13,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:05:13,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1695458142, now seen corresponding path program 1 times [2025-01-10 06:05:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1749376314] [2025-01-10 06:05:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:13,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:13,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:13,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:13,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:05:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:05:14,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:05:14,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:14,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:05:14,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:05:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:05:15,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:05:15,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 06:05:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749376314] [2025-01-10 06:05:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749376314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:05:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:05:15,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:05:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970296326] [2025-01-10 06:05:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:05:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:05:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 06:05:15,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:05:15,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:05:15,885 INFO L87 Difference]: Start difference. First operand 369 states and 506 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-01-10 06:05:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:05:17,511 INFO L93 Difference]: Finished difference Result 385 states and 521 transitions. [2025-01-10 06:05:17,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:05:17,511 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-01-10 06:05:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:05:17,513 INFO L225 Difference]: With dead ends: 385 [2025-01-10 06:05:17,513 INFO L226 Difference]: Without dead ends: 382 [2025-01-10 06:05:17,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:05:17,513 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 17 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2372 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.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:05:17,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2372 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-10 06:05:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-10 06:05:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 379. [2025-01-10 06:05:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 331 states have internal predecessors, (447), 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-01-10 06:05:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 516 transitions. [2025-01-10 06:05:17,526 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 516 transitions. Word has length 34 [2025-01-10 06:05:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:05:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 516 transitions. [2025-01-10 06:05:17,527 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-01-10 06:05:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 516 transitions. [2025-01-10 06:05:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 06:05:17,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:05:17,528 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-01-10 06:05:17,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 06:05:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:17,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2025-01-10 06:05:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:05:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1695456220, now seen corresponding path program 1 times [2025-01-10 06:05:17,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 06:05:17,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011444749] [2025-01-10 06:05:17,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:05:17,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:05:17,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:05:17,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:05:17,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:05:18,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 06:05:18,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 06:05:18,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:05:18,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:05:18,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:05:18,846 INFO L279 TraceCheckSpWp]: Computing forward predicates...