./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/printf-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/printf-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:41:15,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:41:15,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:41:15,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:41:15,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:41:15,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:41:15,528 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:41:15,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:41:15,529 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:41:15,529 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:41:15,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:41:15,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:41:15,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:41:15,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:41:15,530 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:41:15,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:41:15,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:41:15,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:41:15,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:41:15,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:15,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:41:15,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:41:15,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:41:15,534 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-04 14:41:15,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:41:15,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:41:15,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:41:15,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:41:15,786 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:41:15,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-04 14:41:16,945 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f969b0b/f4e2a38ebec145e6ae3046e9c9b9a36a/FLAGe267c86c8 [2025-03-04 14:41:17,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:41:17,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-04 14:41:17,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f969b0b/f4e2a38ebec145e6ae3046e9c9b9a36a/FLAGe267c86c8 [2025-03-04 14:41:17,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f969b0b/f4e2a38ebec145e6ae3046e9c9b9a36a [2025-03-04 14:41:17,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:41:17,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:41:17,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:17,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:41:17,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:41:17,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:17" (1/1) ... [2025-03-04 14:41:17,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62934731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:17, skipping insertion in model container [2025-03-04 14:41:17,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:17" (1/1) ... [2025-03-04 14:41:17,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:41:18,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:18,350 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:41:18,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:18,633 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:41:18,638 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:41:18,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18 WrapperNode [2025-03-04 14:41:18,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:18,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:18,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:41:18,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:41:18,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,775 INFO L138 Inliner]: procedures = 648, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1861 [2025-03-04 14:41:18,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:18,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:41:18,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:41:18,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:41:18,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,799 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:41:18,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:41:18,880 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:41:18,881 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:41:18,881 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:41:18,881 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (1/1) ... [2025-03-04 14:41:18,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:18,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:41:18,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:41:18,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-04 14:41:18,932 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-04 14:41:18,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:41:18,932 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 14:41:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-04 14:41:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:41:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:41:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:41:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:41:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:41:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:41:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:41:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:41:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-04 14:41:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-04 14:41:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:41:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-04 14:41:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:41:18,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-04 14:41:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-04 14:41:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-04 14:41:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2025-03-04 14:41:18,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 14:41:18,937 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-04 14:41:18,937 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-04 14:41:19,321 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:41:19,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:41:19,411 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-04 14:41:19,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-04 14:41:19,658 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-04 14:41:19,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem162#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-04 14:41:19,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-04 14:41:19,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem164#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-04 14:41:19,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem166#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-04 14:41:24,478 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem312#1;havoc __main_#t~short313#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-04 14:41:24,478 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-04 14:41:24,478 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-04 14:41:24,621 INFO L? ?]: Removed 610 outVars from TransFormulas that were not future-live. [2025-03-04 14:41:24,621 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:41:24,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:41:24,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:41:24,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24 BoogieIcfgContainer [2025-03-04 14:41:24,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:41:24,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:41:24,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:41:24,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:41:24,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:41:17" (1/3) ... [2025-03-04 14:41:24,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:41:24, skipping insertion in model container [2025-03-04 14:41:24,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:18" (2/3) ... [2025-03-04 14:41:24,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c3502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:41:24, skipping insertion in model container [2025-03-04 14:41:24,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24" (3/3) ... [2025-03-04 14:41:24,665 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-04 14:41:24,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:41:24,680 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 491 locations, 1 initial locations, 23 loop locations, and 44 error locations. [2025-03-04 14:41:24,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:41:24,744 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;@555e2fc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:41:24,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 14:41:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 491 states, 380 states have (on average 1.5763157894736841) internal successors, (599), 439 states have internal predecessors, (599), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 14:41:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:41:24,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:24,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:41:24,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:24,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 24318335, now seen corresponding path program 1 times [2025-03-04 14:41:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709375106] [2025-03-04 14:41:24,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:25,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:41:25,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:41:25,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:25,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:25,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709375106] [2025-03-04 14:41:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709375106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:25,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:25,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:25,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400505192] [2025-03-04 14:41:25,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:25,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:25,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:25,847 INFO L87 Difference]: Start difference. First operand has 491 states, 380 states have (on average 1.5763157894736841) internal successors, (599), 439 states have internal predecessors, (599), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:25,988 INFO L93 Difference]: Finished difference Result 883 states and 1320 transitions. [2025-03-04 14:41:25,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:41:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:26,001 INFO L225 Difference]: With dead ends: 883 [2025-03-04 14:41:26,002 INFO L226 Difference]: Without dead ends: 378 [2025-03-04 14:41:26,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:26,008 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:26,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1077 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-03-04 14:41:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2025-03-04 14:41:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 317 states have (on average 1.4258675078864353) internal successors, (452), 333 states have internal predecessors, (452), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 519 transitions. [2025-03-04 14:41:26,063 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 519 transitions. Word has length 4 [2025-03-04 14:41:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:26,063 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 519 transitions. [2025-03-04 14:41:26,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 519 transitions. [2025-03-04 14:41:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:41:26,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:26,064 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:41:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:41:26,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1381235981, now seen corresponding path program 1 times [2025-03-04 14:41:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704953915] [2025-03-04 14:41:26,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:26,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:41:26,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:41:26,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:26,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704953915] [2025-03-04 14:41:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704953915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335320439] [2025-03-04 14:41:26,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:26,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:26,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:26,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:41:27,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:41:27,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:41:27,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:27,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:27,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 1683 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:27,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:27,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:27,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335320439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:41:27,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286985758] [2025-03-04 14:41:27,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:27,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:41:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:27,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:41:27,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:27,865 INFO L87 Difference]: Start difference. First operand 378 states and 519 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:27,951 INFO L93 Difference]: Finished difference Result 378 states and 519 transitions. [2025-03-04 14:41:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:41:27,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 14:41:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:27,954 INFO L225 Difference]: With dead ends: 378 [2025-03-04 14:41:27,954 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 14:41:27,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:27,955 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:27,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1011 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 14:41:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-04 14:41:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 317 states have (on average 1.4227129337539433) internal successors, (451), 332 states have internal predecessors, (451), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 518 transitions. [2025-03-04 14:41:27,977 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 518 transitions. Word has length 7 [2025-03-04 14:41:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:27,978 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 518 transitions. [2025-03-04 14:41:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 518 transitions. [2025-03-04 14:41:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:41:27,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:27,978 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:41:27,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:28,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:28,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:28,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:28,182 INFO L85 PathProgramCache]: Analyzing trace with hash 131358273, now seen corresponding path program 1 times [2025-03-04 14:41:28,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:28,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144541066] [2025-03-04 14:41:28,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:28,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:28,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:41:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:41:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:28,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:41:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144541066] [2025-03-04 14:41:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144541066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:28,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:28,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:28,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169562990] [2025-03-04 14:41:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:28,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:28,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:28,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:28,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:28,798 INFO L87 Difference]: Start difference. First operand 377 states and 518 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:28,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:28,896 INFO L93 Difference]: Finished difference Result 377 states and 518 transitions. [2025-03-04 14:41:28,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:28,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:41:28,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:28,898 INFO L225 Difference]: With dead ends: 377 [2025-03-04 14:41:28,898 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 14:41:28,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:28,899 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:28,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1012 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 14:41:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2025-03-04 14:41:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 315 states have (on average 1.4222222222222223) internal successors, (448), 329 states have internal predecessors, (448), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 515 transitions. [2025-03-04 14:41:28,917 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 515 transitions. Word has length 8 [2025-03-04 14:41:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:28,917 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 515 transitions. [2025-03-04 14:41:28,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:41:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 515 transitions. [2025-03-04 14:41:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:41:28,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:28,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:28,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:41:28,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:28,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1076748584, now seen corresponding path program 1 times [2025-03-04 14:41:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036613504] [2025-03-04 14:41:28,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:29,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:41:29,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:41:29,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:29,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:29,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-03-04 14:41:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036613504] [2025-03-04 14:41:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036613504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278444257] [2025-03-04 14:41:29,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:29,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:29,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:29,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:29,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:41:30,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:41:30,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:41:30,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:30,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:30,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 1700 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:41:30,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 14:41:30,642 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:30,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278444257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:30,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:30,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:41:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559848620] [2025-03-04 14:41:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:30,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:30,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:30,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:30,643 INFO L87 Difference]: Start difference. First operand 374 states and 515 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:30,708 INFO L93 Difference]: Finished difference Result 374 states and 515 transitions. [2025-03-04 14:41:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 14:41:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:30,711 INFO L225 Difference]: With dead ends: 374 [2025-03-04 14:41:30,712 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 14:41:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:30,713 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 163 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:30,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 830 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 14:41:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-03-04 14:41:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 315 states have (on average 1.415873015873016) internal successors, (446), 327 states have internal predecessors, (446), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 513 transitions. [2025-03-04 14:41:30,726 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 513 transitions. Word has length 12 [2025-03-04 14:41:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:30,727 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 513 transitions. [2025-03-04 14:41:30,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 513 transitions. [2025-03-04 14:41:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:41:30,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:30,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:30,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:30,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 14:41:30,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:30,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash 980532982, now seen corresponding path program 1 times [2025-03-04 14:41:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686486489] [2025-03-04 14:41:30,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:31,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:41:31,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:41:31,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:31,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686486489] [2025-03-04 14:41:31,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686486489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771715410] [2025-03-04 14:41:31,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:31,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:31,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:31,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:31,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:41:32,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:41:32,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:41:32,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:32,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:32,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:32,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:32,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:32,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:41:32,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771715410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:32,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:32,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:41:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756225751] [2025-03-04 14:41:32,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:32,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:41:32,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:32,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:41:32,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:32,430 INFO L87 Difference]: Start difference. First operand 372 states and 513 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:41:32,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:32,505 INFO L93 Difference]: Finished difference Result 747 states and 1031 transitions. [2025-03-04 14:41:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-04 14:41:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:32,507 INFO L225 Difference]: With dead ends: 747 [2025-03-04 14:41:32,507 INFO L226 Difference]: Without dead ends: 381 [2025-03-04 14:41:32,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:32,508 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 4 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:32,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1511 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:32,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-04 14:41:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-04 14:41:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 324 states have (on average 1.404320987654321) internal successors, (455), 336 states have internal predecessors, (455), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 522 transitions. [2025-03-04 14:41:32,517 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 522 transitions. Word has length 13 [2025-03-04 14:41:32,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:32,517 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 522 transitions. [2025-03-04 14:41:32,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:41:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 522 transitions. [2025-03-04 14:41:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:41:32,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:32,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:32,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:41:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:32,719 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 192220034, now seen corresponding path program 2 times [2025-03-04 14:41:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283056515] [2025-03-04 14:41:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:41:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:33,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:41:33,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:41:33,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:41:33,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:41:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283056515] [2025-03-04 14:41:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283056515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:41:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365822814] [2025-03-04 14:41:33,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:33,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:41:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:33,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:41:33,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:33,455 INFO L87 Difference]: Start difference. First operand 381 states and 522 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:33,600 INFO L93 Difference]: Finished difference Result 381 states and 522 transitions. [2025-03-04 14:41:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:41:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:41:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:33,603 INFO L225 Difference]: With dead ends: 381 [2025-03-04 14:41:33,603 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 14:41:33,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:41:33,604 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 162 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:33,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1811 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 14:41:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-03-04 14:41:33,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 324 states have (on average 1.3981481481481481) internal successors, (453), 334 states have internal predecessors, (453), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:33,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 520 transitions. [2025-03-04 14:41:33,624 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 520 transitions. Word has length 22 [2025-03-04 14:41:33,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:33,624 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 520 transitions. [2025-03-04 14:41:33,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 520 transitions. [2025-03-04 14:41:33,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:41:33,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:33,625 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:33,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:41:33,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:33,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:33,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1584861081, now seen corresponding path program 1 times [2025-03-04 14:41:33,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114585020] [2025-03-04 14:41:33,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:34,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:41:34,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:41:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:41:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114585020] [2025-03-04 14:41:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114585020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:41:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165407485] [2025-03-04 14:41:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:34,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:34,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:34,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:34,346 INFO L87 Difference]: Start difference. First operand 379 states and 520 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:34,402 INFO L93 Difference]: Finished difference Result 741 states and 1024 transitions. [2025-03-04 14:41:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:34,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-04 14:41:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:34,405 INFO L225 Difference]: With dead ends: 741 [2025-03-04 14:41:34,405 INFO L226 Difference]: Without dead ends: 382 [2025-03-04 14:41:34,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:34,406 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 2 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:34,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1001 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-04 14:41:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-03-04 14:41:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 327 states have (on average 1.3944954128440368) internal successors, (456), 337 states have internal predecessors, (456), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 523 transitions. [2025-03-04 14:41:34,421 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 523 transitions. Word has length 27 [2025-03-04 14:41:34,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:34,421 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 523 transitions. [2025-03-04 14:41:34,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 523 transitions. [2025-03-04 14:41:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:41:34,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:34,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:34,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:41:34,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash -15509573, now seen corresponding path program 1 times [2025-03-04 14:41:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:34,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131558832] [2025-03-04 14:41:34,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:34,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:34,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:34,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:34,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 14:41:34,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131558832] [2025-03-04 14:41:34,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131558832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:34,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:34,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:34,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216808060] [2025-03-04 14:41:34,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:34,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:34,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:34,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:34,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:35,000 INFO L87 Difference]: Start difference. First operand 382 states and 523 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:35,057 INFO L93 Difference]: Finished difference Result 395 states and 538 transitions. [2025-03-04 14:41:35,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:41:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:35,059 INFO L225 Difference]: With dead ends: 395 [2025-03-04 14:41:35,059 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 14:41:35,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:35,060 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 3 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:35,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 998 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 14:41:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 391. [2025-03-04 14:41:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 336 states have (on average 1.3958333333333333) internal successors, (469), 346 states have internal predecessors, (469), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 536 transitions. [2025-03-04 14:41:35,072 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 536 transitions. Word has length 30 [2025-03-04 14:41:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:35,072 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 536 transitions. [2025-03-04 14:41:35,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 536 transitions. [2025-03-04 14:41:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:41:35,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:35,073 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:35,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:41:35,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -15509413, now seen corresponding path program 1 times [2025-03-04 14:41:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855713553] [2025-03-04 14:41:35,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:35,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:35,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:35,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:35,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 14:41:35,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855713553] [2025-03-04 14:41:35,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855713553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:35,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919453375] [2025-03-04 14:41:35,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:35,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:35,650 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:35,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:41:36,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:41:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:41:36,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:36,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:36,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:41:36,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:41:36,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 14:41:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919453375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:36,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:41:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312306739] [2025-03-04 14:41:36,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:36,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:41:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:36,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:41:36,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:36,906 INFO L87 Difference]: Start difference. First operand 391 states and 536 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:41:37,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:37,181 INFO L93 Difference]: Finished difference Result 784 states and 1080 transitions. [2025-03-04 14:41:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:41:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-04 14:41:37,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:37,184 INFO L225 Difference]: With dead ends: 784 [2025-03-04 14:41:37,184 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 14:41:37,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:37,185 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 5 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:37,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2477 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:41:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 14:41:37,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 14:41:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 354 states have (on average 1.3700564971751412) internal successors, (485), 363 states have internal predecessors, (485), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 552 transitions. [2025-03-04 14:41:37,200 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 552 transitions. Word has length 30 [2025-03-04 14:41:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:37,200 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 552 transitions. [2025-03-04 14:41:37,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 14:41:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 552 transitions. [2025-03-04 14:41:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:41:37,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:37,201 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:37,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:41:37,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:37,403 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:37,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash 225096521, now seen corresponding path program 1 times [2025-03-04 14:41:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:37,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145623606] [2025-03-04 14:41:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:37,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:41:37,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:41:37,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:37,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:41:37,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145623606] [2025-03-04 14:41:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145623606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:37,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:37,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:37,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312044382] [2025-03-04 14:41:37,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:37,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:37,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:37,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:37,986 INFO L87 Difference]: Start difference. First operand 408 states and 552 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:38,029 INFO L93 Difference]: Finished difference Result 408 states and 552 transitions. [2025-03-04 14:41:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:41:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:38,031 INFO L225 Difference]: With dead ends: 408 [2025-03-04 14:41:38,031 INFO L226 Difference]: Without dead ends: 407 [2025-03-04 14:41:38,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:38,032 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:38,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 999 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-04 14:41:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 403. [2025-03-04 14:41:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 350 states have (on average 1.3685714285714285) internal successors, (479), 358 states have internal predecessors, (479), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 546 transitions. [2025-03-04 14:41:38,046 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 546 transitions. Word has length 49 [2025-03-04 14:41:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:38,046 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 546 transitions. [2025-03-04 14:41:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 546 transitions. [2025-03-04 14:41:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:41:38,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:38,047 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 14:41:38,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:38,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:38,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1278889527, now seen corresponding path program 1 times [2025-03-04 14:41:38,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:38,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625016487] [2025-03-04 14:41:38,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:38,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:38,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:41:38,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:41:38,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:38,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625016487] [2025-03-04 14:41:38,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625016487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:38,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:38,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:41:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437548062] [2025-03-04 14:41:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:41:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:38,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:41:38,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:38,623 INFO L87 Difference]: Start difference. First operand 403 states and 546 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:38,676 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2025-03-04 14:41:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:41:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 14:41:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:38,679 INFO L225 Difference]: With dead ends: 408 [2025-03-04 14:41:38,679 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 14:41:38,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:41:38,680 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:38,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 998 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 14:41:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2025-03-04 14:41:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 353 states have (on average 1.3654390934844192) internal successors, (482), 361 states have internal predecessors, (482), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2025-03-04 14:41:38,695 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 49 [2025-03-04 14:41:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:38,696 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2025-03-04 14:41:38,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2025-03-04 14:41:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 14:41:38,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:38,698 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:38,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:41:38,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:38,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:38,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1257462711, now seen corresponding path program 1 times [2025-03-04 14:41:38,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106971039] [2025-03-04 14:41:38,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:38,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:39,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 14:41:39,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 14:41:39,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:39,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106971039] [2025-03-04 14:41:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106971039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670907941] [2025-03-04 14:41:39,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:39,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:39,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:39,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:41:40,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 14:41:40,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 14:41:40,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:40,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:40,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 2028 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:41:40,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:40,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:40,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670907941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:40,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:40,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2025-03-04 14:41:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887215688] [2025-03-04 14:41:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:40,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:41:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:40,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:41:40,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:40,394 INFO L87 Difference]: Start difference. First operand 406 states and 549 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:40,444 INFO L93 Difference]: Finished difference Result 417 states and 561 transitions. [2025-03-04 14:41:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:41:40,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-04 14:41:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:40,448 INFO L225 Difference]: With dead ends: 417 [2025-03-04 14:41:40,448 INFO L226 Difference]: Without dead ends: 408 [2025-03-04 14:41:40,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:40,449 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 0 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:40,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1500 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:41:40,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-03-04 14:41:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-03-04 14:41:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.3633802816901408) internal successors, (484), 363 states have internal predecessors, (484), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 551 transitions. [2025-03-04 14:41:40,460 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 551 transitions. Word has length 52 [2025-03-04 14:41:40,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:40,460 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 551 transitions. [2025-03-04 14:41:40,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 551 transitions. [2025-03-04 14:41:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:41:40,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:40,461 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:40,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:41:40,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 14:41:40,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:40,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:40,662 INFO L85 PathProgramCache]: Analyzing trace with hash -621653985, now seen corresponding path program 1 times [2025-03-04 14:41:40,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:40,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226651152] [2025-03-04 14:41:40,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:40,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:41,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:41:41,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:41:41,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:41,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:41,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226651152] [2025-03-04 14:41:41,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226651152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:41,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878400875] [2025-03-04 14:41:41,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:41,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:41,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:41,269 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:41,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:41:42,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:41:42,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:41:42,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:42,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:42,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:41:42,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:42,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878400875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:42,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:41:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290863925] [2025-03-04 14:41:42,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:42,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:41:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:42,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:41:42,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:42,409 INFO L87 Difference]: Start difference. First operand 408 states and 551 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:42,503 INFO L93 Difference]: Finished difference Result 791 states and 1079 transitions. [2025-03-04 14:41:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-04 14:41:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:42,506 INFO L225 Difference]: With dead ends: 791 [2025-03-04 14:41:42,506 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 14:41:42,507 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-03-04 14:41:42,508 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 4 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:42,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1995 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 14:41:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-04 14:41:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 381 states have internal predecessors, (502), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:41:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 569 transitions. [2025-03-04 14:41:42,520 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 569 transitions. Word has length 55 [2025-03-04 14:41:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:42,521 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 569 transitions. [2025-03-04 14:41:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 569 transitions. [2025-03-04 14:41:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 14:41:42,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:42,522 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:42,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:41:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:42,723 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1036700240, now seen corresponding path program 1 times [2025-03-04 14:41:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445969286] [2025-03-04 14:41:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:43,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:41:43,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:41:43,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:43,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445969286] [2025-03-04 14:41:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445969286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949195694] [2025-03-04 14:41:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:43,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:43,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:41:44,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 14:41:44,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 14:41:44,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:44,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:44,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:41:44,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:44,408 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-04 14:41:44,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:41:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949195694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:44,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:41:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-04 14:41:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501787104] [2025-03-04 14:41:44,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:44,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:41:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:44,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:41:44,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:44,410 INFO L87 Difference]: Start difference. First operand 426 states and 569 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:44,551 INFO L93 Difference]: Finished difference Result 546 states and 744 transitions. [2025-03-04 14:41:44,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:41:44,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-04 14:41:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:44,553 INFO L225 Difference]: With dead ends: 546 [2025-03-04 14:41:44,554 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 14:41:44,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:41:44,554 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 140 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:44,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1639 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 14:41:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 530. [2025-03-04 14:41:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 466 states have (on average 1.3626609442060085) internal successors, (635), 476 states have internal predecessors, (635), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 14:41:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 723 transitions. [2025-03-04 14:41:44,567 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 723 transitions. Word has length 56 [2025-03-04 14:41:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:44,567 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 723 transitions. [2025-03-04 14:41:44,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 723 transitions. [2025-03-04 14:41:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:41:44,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:44,568 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:44,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:41:44,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:44,769 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:44,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:44,769 INFO L85 PathProgramCache]: Analyzing trace with hash 93051279, now seen corresponding path program 1 times [2025-03-04 14:41:44,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:44,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366139393] [2025-03-04 14:41:44,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:44,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:45,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:41:45,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:41:45,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:45,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366139393] [2025-03-04 14:41:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366139393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:45,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:45,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:41:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984121074] [2025-03-04 14:41:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:45,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:41:45,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:45,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:41:45,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:45,396 INFO L87 Difference]: Start difference. First operand 530 states and 723 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:45,523 INFO L93 Difference]: Finished difference Result 546 states and 738 transitions. [2025-03-04 14:41:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 14:41:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:45,525 INFO L225 Difference]: With dead ends: 546 [2025-03-04 14:41:45,525 INFO L226 Difference]: Without dead ends: 543 [2025-03-04 14:41:45,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:41:45,526 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 17 mSDsluCounter, 1989 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:45,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2487 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:41:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-04 14:41:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 540. [2025-03-04 14:41:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 473 states have (on average 1.3594080338266386) internal successors, (643), 483 states have internal predecessors, (643), 46 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 14:41:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 733 transitions. [2025-03-04 14:41:45,540 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 733 transitions. Word has length 58 [2025-03-04 14:41:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:45,540 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 733 transitions. [2025-03-04 14:41:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 733 transitions. [2025-03-04 14:41:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 14:41:45,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:45,541 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 14:41:45,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:45,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash 93052240, now seen corresponding path program 1 times [2025-03-04 14:41:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704061101] [2025-03-04 14:41:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:45,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 14:41:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 14:41:46,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:46,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-04 14:41:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704061101] [2025-03-04 14:41:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704061101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:41:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:41:46,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:41:46,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397391640] [2025-03-04 14:41:46,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:41:46,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:41:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:46,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:41:46,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:41:46,430 INFO L87 Difference]: Start difference. First operand 540 states and 733 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:46,626 INFO L93 Difference]: Finished difference Result 785 states and 1060 transitions. [2025-03-04 14:41:46,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:41:46,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2025-03-04 14:41:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:46,629 INFO L225 Difference]: With dead ends: 785 [2025-03-04 14:41:46,629 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 14:41:46,629 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-03-04 14:41:46,630 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 170 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:46,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1943 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:41:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 14:41:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-04 14:41:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 380 states have (on average 1.3394736842105264) internal successors, (509), 388 states have internal predecessors, (509), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:41:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 578 transitions. [2025-03-04 14:41:46,641 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 578 transitions. Word has length 58 [2025-03-04 14:41:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:46,641 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 578 transitions. [2025-03-04 14:41:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 578 transitions. [2025-03-04 14:41:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 14:41:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:46,642 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:41:46,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1946246152, now seen corresponding path program 1 times [2025-03-04 14:41:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:46,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192427447] [2025-03-04 14:41:46,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:41:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:41:47,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 14:41:47,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:41:47,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192427447] [2025-03-04 14:41:47,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192427447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:41:47,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805262131] [2025-03-04 14:41:47,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:47,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:41:47,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:47,230 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:41:47,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:41:48,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 14:41:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 14:41:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:41:48,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:41:48,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:41:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:48,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:41:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-04 14:41:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805262131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:41:48,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:41:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:41:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672524314] [2025-03-04 14:41:48,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:41:48,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:41:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:41:48,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:41:48,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:48,588 INFO L87 Difference]: Start difference. First operand 436 states and 578 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:41:48,779 INFO L93 Difference]: Finished difference Result 855 states and 1149 transitions. [2025-03-04 14:41:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:41:48,780 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2025-03-04 14:41:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:41:48,782 INFO L225 Difference]: With dead ends: 855 [2025-03-04 14:41:48,782 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 14:41:48,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:41:48,783 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 5 mSDsluCounter, 2960 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:41:48,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3456 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:41:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 14:41:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-04 14:41:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 416 states have (on average 1.3076923076923077) internal successors, (544), 423 states have internal predecessors, (544), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:41:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 613 transitions. [2025-03-04 14:41:48,793 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 613 transitions. Word has length 72 [2025-03-04 14:41:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:41:48,793 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 613 transitions. [2025-03-04 14:41:48,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:41:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 613 transitions. [2025-03-04 14:41:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 14:41:48,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:41:48,794 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:48,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:41:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 14:41:48,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:41:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:41:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1440726392, now seen corresponding path program 1 times [2025-03-04 14:41:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:41:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348812220] [2025-03-04 14:41:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:41:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:41:49,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:41:49,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:41:49,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:49,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:41:49,675 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:41:49,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 14:41:49,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 14:41:49,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:41:49,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:41:49,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:41:49,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:41:49,952 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE (43 of 44 remaining) [2025-03-04 14:41:49,955 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_ascii_isalnumErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (34 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-03-04 14:41:49,956 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location bb_verror_msgErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-03-04 14:41:49,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-03-04 14:41:49,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-03-04 14:41:49,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-03-04 14:41:49,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-03-04 14:41:49,958 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-03-04 14:41:49,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:41:49,960 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:41:50,024 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:41:50,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:41:50 BoogieIcfgContainer [2025-03-04 14:41:50,028 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:41:50,029 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:41:50,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:41:50,029 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:41:50,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:41:24" (3/4) ... [2025-03-04 14:41:50,031 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:41:50,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:41:50,032 INFO L158 Benchmark]: Toolchain (without parser) took 32531.98ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 108.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,032 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:41:50,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1138.21ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 60.2MB in the end (delta: 47.9MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.72ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 60.2MB in the beginning and 367.6MB in the end (delta: -307.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,033 INFO L158 Benchmark]: Boogie Preprocessor took 102.64ms. Allocated memory is still 411.0MB. Free memory was 367.6MB in the beginning and 355.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,033 INFO L158 Benchmark]: IcfgBuilder took 5773.07ms. Allocated memory is still 411.0MB. Free memory was 355.0MB in the beginning and 145.5MB in the end (delta: 209.6MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,034 INFO L158 Benchmark]: TraceAbstraction took 25368.91ms. Allocated memory was 411.0MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 144.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-03-04 14:41:50,034 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 140.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:41:50,035 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.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1138.21ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 60.2MB in the end (delta: 47.9MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.72ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 60.2MB in the beginning and 367.6MB in the end (delta: -307.5MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.64ms. Allocated memory is still 411.0MB. Free memory was 367.6MB in the beginning and 355.0MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 5773.07ms. Allocated memory is still 411.0MB. Free memory was 355.0MB in the beginning and 145.5MB in the end (delta: 209.6MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25368.91ms. Allocated memory was 411.0MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 144.7MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.6GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 140.9kB). 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/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 -> 7d17dd656752f8bfe37b555fca60e9904e2f2b89fd59148dbd3120bfaecc3203 [2025-03-04 14:41:52,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:41:52,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:41:52,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:41:52,338 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:41:52,338 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:41:52,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-04 14:41:53,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647af72f2/9e9c1460ea144d6383e79c282b5cf294/FLAGe6a3f53eb [2025-03-04 14:41:53,828 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:41:53,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/printf-2.i [2025-03-04 14:41:53,859 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647af72f2/9e9c1460ea144d6383e79c282b5cf294/FLAGe6a3f53eb [2025-03-04 14:41:53,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/647af72f2/9e9c1460ea144d6383e79c282b5cf294 [2025-03-04 14:41:53,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:41:53,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:41:53,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:53,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:41:53,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:41:53,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:53" (1/1) ... [2025-03-04 14:41:53,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122df84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:53, skipping insertion in model container [2025-03-04 14:41:53,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:41:53" (1/1) ... [2025-03-04 14:41:53,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:41:54,668 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,669 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,678 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,681 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,683 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,684 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,687 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,687 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,688 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,691 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,692 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,693 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,694 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,694 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,696 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,698 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,724 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,724 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,735 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,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-03-04 14:41:54,748 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,754 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,754 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,754 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,756 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,765 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,767 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,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-03-04 14:41:54,778 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,789 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 14:41:54,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:54,833 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:41:54,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:41:55,108 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-04 14:41:55,116 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:41:55,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55 WrapperNode [2025-03-04 14:41:55,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:41:55,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:55,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:41:55,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:41:55,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,240 INFO L138 Inliner]: procedures = 663, calls = 864, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1803 [2025-03-04 14:41:55,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:41:55,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:41:55,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:41:55,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:41:55,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,268 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 14:41:55,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:41:55,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:41:55,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:41:55,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:41:55,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (1/1) ... [2025-03-04 14:41:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:41:55,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:41:55,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 14:41:55,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 14:41:55,441 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2025-03-04 14:41:55,442 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2025-03-04 14:41:55,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intFLOATTYPE8 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2025-03-04 14:41:55,443 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-04 14:41:55,443 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-04 14:41:55,837 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:41:55,838 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:41:55,937 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: call ULTIMATE.dealloc(~#endptr~1.base, ~#endptr~1.offset);havoc ~#endptr~1.base, ~#endptr~1.offset; [2025-03-04 14:41:56,270 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2546: call ULTIMATE.dealloc(bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset);havoc bb_strtoull_~#endptr~2#1.base, bb_strtoull_~#endptr~2#1.offset; [2025-03-04 14:41:56,320 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: call ULTIMATE.dealloc(bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset);havoc bb_strtoi_~#endptr~0#1.base, bb_strtoi_~#endptr~0#1.offset; [2025-03-04 14:41:56,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2773: havoc my_xstrtod_#t~mem159#1;call ULTIMATE.dealloc(my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset);havoc my_xstrtod_~#result~0#1.base, my_xstrtod_~#result~0#1.offset; [2025-03-04 14:41:56,546 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc ~return_value_my_xstrtoull$2~0#1; [2025-03-04 14:41:56,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc my_xstrtoll_#t~mem161#1;call ULTIMATE.dealloc(my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset);havoc my_xstrtoll_~#result~1#1.base, my_xstrtoll_~#result~1#1.offset; [2025-03-04 14:41:56,547 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc my_xstrtoull_#t~mem163#1;call ULTIMATE.dealloc(my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset);havoc my_xstrtoull_~#result~2#1.base, my_xstrtoull_~#result~2#1.offset; [2025-03-04 14:42:04,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3232: havoc __main_#t~mem307#1;havoc __main_#t~short308#1;call ULTIMATE.dealloc(__main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset);havoc __main_~#conv_err~0#1.base, __main_~#conv_err~0#1.offset; [2025-03-04 14:42:04,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: call ULTIMATE.dealloc(print_formatted_~#f#1.base, print_formatted_~#f#1.offset);havoc print_formatted_~#f#1.base, print_formatted_~#f#1.offset; [2025-03-04 14:42:04,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3049: havoc print_formatted_~p~3#1.base, print_formatted_~p~3#1.offset, print_formatted_~return_value___builtin_strchr$5~0#1.base, print_formatted_~return_value___builtin_strchr$5~0#1.offset; [2025-03-04 14:42:04,865 INFO L? ?]: Removed 586 outVars from TransFormulas that were not future-live. [2025-03-04 14:42:04,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:42:04,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:42:04,881 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:42:04,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:04 BoogieIcfgContainer [2025-03-04 14:42:04,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:42:04,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:42:04,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:42:04,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:42:04,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:41:53" (1/3) ... [2025-03-04 14:42:04,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311d92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:04, skipping insertion in model container [2025-03-04 14:42:04,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:41:55" (2/3) ... [2025-03-04 14:42:04,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311d92d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:42:04, skipping insertion in model container [2025-03-04 14:42:04,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:42:04" (3/3) ... [2025-03-04 14:42:04,888 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-2.i [2025-03-04 14:42:04,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:42:04,901 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-2.i that has 15 procedures, 475 locations, 1 initial locations, 23 loop locations, and 44 error locations. [2025-03-04 14:42:04,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:42:04,960 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;@6dc39b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:42:04,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-04 14:42:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 423 states have internal predecessors, (573), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 14:42:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:42:04,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:04,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:42:04,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:04,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash 23364031, now seen corresponding path program 1 times [2025-03-04 14:42:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755192375] [2025-03-04 14:42:04,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:04,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:04,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:04,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:04,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 14:42:05,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:42:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:42:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:06,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:42:06,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:06,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:06,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755192375] [2025-03-04 14:42:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755192375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:42:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137924754] [2025-03-04 14:42:06,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:06,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:42:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:06,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:42:06,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:42:06,181 INFO L87 Difference]: Start difference. First operand has 475 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 423 states have internal predecessors, (573), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:06,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:06,223 INFO L93 Difference]: Finished difference Result 841 states and 1256 transitions. [2025-03-04 14:42:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:42:06,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 14:42:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:06,234 INFO L225 Difference]: With dead ends: 841 [2025-03-04 14:42:06,234 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 14:42:06,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:42:06,244 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:06,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:42:06,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 14:42:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 14:42:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 301 states have (on average 1.4019933554817277) internal successors, (422), 309 states have internal predecessors, (422), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 489 transitions. [2025-03-04 14:42:06,305 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 489 transitions. Word has length 4 [2025-03-04 14:42:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:06,306 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 489 transitions. [2025-03-04 14:42:06,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 489 transitions. [2025-03-04 14:42:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:42:06,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:06,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:42:06,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:42:06,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:06,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 724285654, now seen corresponding path program 1 times [2025-03-04 14:42:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160997896] [2025-03-04 14:42:06,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:06,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:06,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:06,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:06,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 14:42:07,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:42:07,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:42:07,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:07,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:07,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:07,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:07,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:07,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160997896] [2025-03-04 14:42:07,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160997896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:07,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:07,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:07,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948218195] [2025-03-04 14:42:07,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:07,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:07,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:07,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:07,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:07,979 INFO L87 Difference]: Start difference. First operand 354 states and 489 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:08,282 INFO L93 Difference]: Finished difference Result 706 states and 976 transitions. [2025-03-04 14:42:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 14:42:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:08,286 INFO L225 Difference]: With dead ends: 706 [2025-03-04 14:42:08,286 INFO L226 Difference]: Without dead ends: 357 [2025-03-04 14:42:08,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-03-04 14:42:08,287 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:08,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 969 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:42:08,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-04 14:42:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-04 14:42:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 304 states have (on average 1.3980263157894737) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:08,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-04 14:42:08,312 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 5 [2025-03-04 14:42:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:08,312 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-04 14:42:08,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-04 14:42:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:42:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:08,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:42:08,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 14:42:08,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:08,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:08,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:08,514 INFO L85 PathProgramCache]: Analyzing trace with hash -721084735, now seen corresponding path program 1 times [2025-03-04 14:42:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:08,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146942042] [2025-03-04 14:42:08,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:08,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:08,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:08,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:08,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 14:42:09,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:42:09,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:42:09,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:09,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:09,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:09,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:10,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 14:42:11,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146942042] [2025-03-04 14:42:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146942042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:11,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:42:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:42:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624802401] [2025-03-04 14:42:11,110 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:11,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:11,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:11,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:11,111 INFO L87 Difference]: Start difference. First operand 357 states and 492 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:11,990 INFO L93 Difference]: Finished difference Result 709 states and 981 transitions. [2025-03-04 14:42:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 14:42:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:11,993 INFO L225 Difference]: With dead ends: 709 [2025-03-04 14:42:11,993 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 14:42:11,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:11,997 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:11,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1450 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 14:42:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 14:42:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2025-03-04 14:42:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 305 states have (on average 1.3934426229508197) internal successors, (425), 312 states have internal predecessors, (425), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 492 transitions. [2025-03-04 14:42:12,016 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 492 transitions. Word has length 8 [2025-03-04 14:42:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:12,016 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 492 transitions. [2025-03-04 14:42:12,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 14:42:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 492 transitions. [2025-03-04 14:42:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:42:12,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:12,017 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:12,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 14:42:12,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:12,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:12,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1554471313, now seen corresponding path program 1 times [2025-03-04 14:42:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:12,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254743464] [2025-03-04 14:42:12,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:12,221 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:12,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 14:42:12,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:42:13,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:42:13,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:13,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:13,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:42:13,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:14,262 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:14,263 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254743464] [2025-03-04 14:42:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254743464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:42:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405442443] [2025-03-04 14:42:14,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:42:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:14,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:42:14,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:14,264 INFO L87 Difference]: Start difference. First operand 357 states and 492 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:15,680 INFO L93 Difference]: Finished difference Result 357 states and 492 transitions. [2025-03-04 14:42:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:42:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-04 14:42:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:15,685 INFO L225 Difference]: With dead ends: 357 [2025-03-04 14:42:15,685 INFO L226 Difference]: Without dead ends: 355 [2025-03-04 14:42:15,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:42:15,685 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 148 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:15,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1743 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-04 14:42:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-04 14:42:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2025-03-04 14:42:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 305 states have (on average 1.3868852459016394) internal successors, (423), 310 states have internal predecessors, (423), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 490 transitions. [2025-03-04 14:42:15,701 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 490 transitions. Word has length 16 [2025-03-04 14:42:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:15,703 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 490 transitions. [2025-03-04 14:42:15,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 490 transitions. [2025-03-04 14:42:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:42:15,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:15,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:15,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:42:15,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:15,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1286049595, now seen corresponding path program 1 times [2025-03-04 14:42:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018580101] [2025-03-04 14:42:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:15,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:15,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:15,908 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:15,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 14:42:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:42:16,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:42:16,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:16,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:16,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:16,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:17,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:17,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018580101] [2025-03-04 14:42:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018580101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:17,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:17,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:17,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531775981] [2025-03-04 14:42:17,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:17,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:17,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:17,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:17,281 INFO L87 Difference]: Start difference. First operand 355 states and 490 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:17,760 INFO L93 Difference]: Finished difference Result 363 states and 500 transitions. [2025-03-04 14:42:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:42:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:17,763 INFO L225 Difference]: With dead ends: 363 [2025-03-04 14:42:17,763 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 14:42:17,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-03-04 14:42:17,765 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 4 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:17,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 959 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:42:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 14:42:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2025-03-04 14:42:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 311 states have (on average 1.3890675241157557) internal successors, (432), 316 states have internal predecessors, (432), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 499 transitions. [2025-03-04 14:42:17,780 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 499 transitions. Word has length 22 [2025-03-04 14:42:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:17,781 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 499 transitions. [2025-03-04 14:42:17,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 499 transitions. [2025-03-04 14:42:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:42:17,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:17,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:17,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 14:42:17,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:17,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:17,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1286044630, now seen corresponding path program 1 times [2025-03-04 14:42:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:17,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357956161] [2025-03-04 14:42:17,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:17,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:17,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:17,985 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:17,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 14:42:18,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:42:18,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:42:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:19,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:19,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:19,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:19,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357956161] [2025-03-04 14:42:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357956161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339539518] [2025-03-04 14:42:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:19,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:19,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:19,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:19,383 INFO L87 Difference]: Start difference. First operand 361 states and 499 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:19,717 INFO L93 Difference]: Finished difference Result 710 states and 985 transitions. [2025-03-04 14:42:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:19,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-04 14:42:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:19,722 INFO L225 Difference]: With dead ends: 710 [2025-03-04 14:42:19,722 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 14:42:19,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-03-04 14:42:19,723 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:19,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:42:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 14:42:19,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-04 14:42:19,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 317 states have (on average 1.3817034700315458) internal successors, (438), 322 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 505 transitions. [2025-03-04 14:42:19,735 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 505 transitions. Word has length 22 [2025-03-04 14:42:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:19,736 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 505 transitions. [2025-03-04 14:42:19,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:19,736 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 505 transitions. [2025-03-04 14:42:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:42:19,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:19,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:19,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 14:42:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:19,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1446615843, now seen corresponding path program 1 times [2025-03-04 14:42:19,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913720739] [2025-03-04 14:42:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:19,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:19,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 14:42:20,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:42:20,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:42:20,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:20,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:21,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:21,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:21,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:42:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:22,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913720739] [2025-03-04 14:42:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913720739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:42:22,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:42:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:42:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921166896] [2025-03-04 14:42:22,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:42:22,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:22,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:22,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:22,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:22,807 INFO L87 Difference]: Start difference. First operand 367 states and 505 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:23,850 INFO L93 Difference]: Finished difference Result 720 states and 998 transitions. [2025-03-04 14:42:23,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:23,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-04 14:42:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:23,853 INFO L225 Difference]: With dead ends: 720 [2025-03-04 14:42:23,853 INFO L226 Difference]: Without dead ends: 374 [2025-03-04 14:42:23,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:42:23,855 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:23,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1918 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 14:42:23,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-04 14:42:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 368. [2025-03-04 14:42:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 319 states have (on average 1.3730407523510972) internal successors, (438), 323 states have internal predecessors, (438), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 505 transitions. [2025-03-04 14:42:23,872 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 505 transitions. Word has length 25 [2025-03-04 14:42:23,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:23,872 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 505 transitions. [2025-03-04 14:42:23,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 505 transitions. [2025-03-04 14:42:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 14:42:23,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:23,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:23,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 14:42:24,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:24,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1273944762, now seen corresponding path program 1 times [2025-03-04 14:42:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829856900] [2025-03-04 14:42:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:24,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:24,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:24,078 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:24,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 14:42:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 14:42:25,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 14:42:25,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:25,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:25,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:42:25,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:25,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:25,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829856900] [2025-03-04 14:42:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829856900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:42:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699055933] [2025-03-04 14:42:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:25,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:42:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:25,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:42:25,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:42:25,514 INFO L87 Difference]: Start difference. First operand 368 states and 505 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:25,851 INFO L93 Difference]: Finished difference Result 375 states and 513 transitions. [2025-03-04 14:42:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:42:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 14:42:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:25,853 INFO L225 Difference]: With dead ends: 375 [2025-03-04 14:42:25,853 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 14:42:25,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:42:25,854 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 0 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:25,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1443 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:42:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 14:42:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-04 14:42:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 321 states have (on average 1.3707165109034267) internal successors, (440), 325 states have internal predecessors, (440), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 507 transitions. [2025-03-04 14:42:25,869 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 507 transitions. Word has length 26 [2025-03-04 14:42:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:25,869 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 507 transitions. [2025-03-04 14:42:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 507 transitions. [2025-03-04 14:42:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:42:25,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:25,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:25,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 14:42:26,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:26,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:26,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash -923818017, now seen corresponding path program 1 times [2025-03-04 14:42:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:26,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881264758] [2025-03-04 14:42:26,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:26,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:26,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:26,074 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:26,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 14:42:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:42:27,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:42:27,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:27,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:27,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:42:27,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:27,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:27,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:27,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881264758] [2025-03-04 14:42:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881264758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:27,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:27,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:42:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267025236] [2025-03-04 14:42:27,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:27,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:42:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:42:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:42:27,402 INFO L87 Difference]: Start difference. First operand 370 states and 507 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:27,680 INFO L93 Difference]: Finished difference Result 374 states and 511 transitions. [2025-03-04 14:42:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:42:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-04 14:42:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:27,682 INFO L225 Difference]: With dead ends: 374 [2025-03-04 14:42:27,682 INFO L226 Difference]: Without dead ends: 373 [2025-03-04 14:42:27,682 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-03-04 14:42:27,683 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:27,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 961 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:42:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-04 14:42:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2025-03-04 14:42:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 324 states have (on average 1.367283950617284) internal successors, (443), 328 states have internal predecessors, (443), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 14:42:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 510 transitions. [2025-03-04 14:42:27,691 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 510 transitions. Word has length 30 [2025-03-04 14:42:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:27,692 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 510 transitions. [2025-03-04 14:42:27,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 510 transitions. [2025-03-04 14:42:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 14:42:27,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:27,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:27,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 14:42:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:27,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:27,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash -403197828, now seen corresponding path program 1 times [2025-03-04 14:42:27,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:27,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948661869] [2025-03-04 14:42:27,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:27,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:27,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:27,898 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 14:42:28,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 14:42:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 14:42:28,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:28,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:42:28,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:30,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:30,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948661869] [2025-03-04 14:42:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948661869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:42:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945138748] [2025-03-04 14:42:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:30,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:30,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:30,238 INFO L87 Difference]: Start difference. First operand 373 states and 510 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:31,855 INFO L93 Difference]: Finished difference Result 389 states and 525 transitions. [2025-03-04 14:42:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 14:42:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:31,858 INFO L225 Difference]: With dead ends: 389 [2025-03-04 14:42:31,858 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 14:42:31,858 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-03-04 14:42:31,858 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 17 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:31,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2392 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 14:42:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 14:42:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2025-03-04 14:42:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 331 states have (on average 1.3625377643504533) internal successors, (451), 335 states have internal predecessors, (451), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:42:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 520 transitions. [2025-03-04 14:42:31,873 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 520 transitions. Word has length 34 [2025-03-04 14:42:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:31,873 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 520 transitions. [2025-03-04 14:42:31,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 520 transitions. [2025-03-04 14:42:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 14:42:31,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:31,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:31,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 14:42:32,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:32,076 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting bb_verror_msgErr19ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:32,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash -403196867, now seen corresponding path program 1 times [2025-03-04 14:42:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:32,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1437186781] [2025-03-04 14:42:32,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:32,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:32,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:32,080 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:32,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 14:42:32,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 14:42:33,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 14:42:33,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:33,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:33,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:42:33,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 14:42:35,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:42:35,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:42:35,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437186781] [2025-03-04 14:42:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437186781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:42:35,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:42:35,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:42:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744526695] [2025-03-04 14:42:35,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:42:35,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:42:35,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:42:35,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:42:35,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:35,087 INFO L87 Difference]: Start difference. First operand 383 states and 520 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:42:37,632 INFO L93 Difference]: Finished difference Result 731 states and 999 transitions. [2025-03-04 14:42:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:42:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2025-03-04 14:42:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:42:37,634 INFO L225 Difference]: With dead ends: 731 [2025-03-04 14:42:37,635 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 14:42:37,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:42:37,636 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 157 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:42:37,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1868 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 14:42:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 14:42:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-03-04 14:42:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 331 states have (on average 1.3595166163141994) internal successors, (450), 335 states have internal predecessors, (450), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 14:42:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 519 transitions. [2025-03-04 14:42:37,644 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 519 transitions. Word has length 34 [2025-03-04 14:42:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:42:37,644 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 519 transitions. [2025-03-04 14:42:37,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 14:42:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 519 transitions. [2025-03-04 14:42:37,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:42:37,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:42:37,645 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:42:37,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 14:42:37,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:37,846 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_process_escape_sequenceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_process_escape_sequenceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 42 more)] === [2025-03-04 14:42:37,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:42:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -994515587, now seen corresponding path program 1 times [2025-03-04 14:42:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:42:37,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799337734] [2025-03-04 14:42:37,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:42:37,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:42:37,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:42:37,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 14:42:37,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 14:42:38,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:42:38,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:42:38,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:42:38,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:42:39,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:42:39,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:42:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 14:42:40,613 INFO L312 TraceCheckSpWp]: Computing backward predicates...