./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/touch-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/busybox-1.22.0/touch-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:59:10,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:59:10,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:59:10,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:59:10,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:59:10,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:59:10,161 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:59:10,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:59:10,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:59:10,161 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:59:10,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:59:10,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:59:10,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:59:10,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:59:10,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:59:10,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:59:10,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:59:10,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:59:10,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:59:10,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:59:10,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:59:10,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:59:10,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:59:10,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:59:10,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:59:10,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:59:10,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:59:10,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:59:10,166 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 -> 7b17d1831b9ff605ca6c7fab07a078cc44dbcf944c26115d18aca71cee657332 [2025-03-17 18:59:10,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:59:10,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:59:10,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:59:10,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:59:10,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:59:10,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-03-17 18:59:11,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1addfc24/c354190501a041ceb05e5c45fab7d23d/FLAG688432ac9 [2025-03-17 18:59:11,951 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:59:11,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/touch-1.i [2025-03-17 18:59:11,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1addfc24/c354190501a041ceb05e5c45fab7d23d/FLAG688432ac9 [2025-03-17 18:59:12,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1addfc24/c354190501a041ceb05e5c45fab7d23d [2025-03-17 18:59:12,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:59:12,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:59:12,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:59:12,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:59:12,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:59:12,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:59:12" (1/1) ... [2025-03-17 18:59:12,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33eac4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:12, skipping insertion in model container [2025-03-17 18:59:12,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:59:12" (1/1) ... [2025-03-17 18:59:12,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:59:12,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:59:13,025 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:59:13,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:59:13,298 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:59:13,303 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:59:13,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13 WrapperNode [2025-03-17 18:59:13,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:59:13,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:59:13,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:59:13,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:59:13,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,443 INFO L138 Inliner]: procedures = 669, calls = 1057, calls flagged for inlining = 38, calls inlined = 37, statements flattened = 2966 [2025-03-17 18:59:13,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:59:13,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:59:13,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:59:13,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:59:13,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,471 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:59:13,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:59:13,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:59:13,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:59:13,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:59:13,594 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (1/1) ... [2025-03-17 18:59:13,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:59:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:59:13,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 18:59:13,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure utimes [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure utimes [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-17 18:59:13,641 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-17 18:59:13,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-17 18:59:13,642 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-17 18:59:13,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 18:59:14,032 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:59:14,034 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:59:14,337 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3702: havoc #t~ret433#1; [2025-03-17 18:59:25,074 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: call ULTIMATE.dealloc(getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset);havoc getopt32_~#complementary~0#1.base, getopt32_~#complementary~0#1.offset; [2025-03-17 18:59:25,075 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3415: call ULTIMATE.dealloc(__main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset);havoc __main_~#reference_file~0#1.base, __main_~#reference_file~0#1.offset;call ULTIMATE.dealloc(__main_~#date_str~0#1.base, __main_~#date_str~0#1.offset);havoc __main_~#date_str~0#1.base, __main_~#date_str~0#1.offset;call ULTIMATE.dealloc(__main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset);havoc __main_~#timebuf~0#1.base, __main_~#timebuf~0#1.offset; [2025-03-17 18:59:25,075 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3752: havoc lutimes_#t~ret476#1; [2025-03-17 18:59:25,075 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2603: call ULTIMATE.dealloc(bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset);havoc bb_strtoll_~#endptr~0#1.base, bb_strtoll_~#endptr~0#1.offset; [2025-03-17 18:59:25,075 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798: havoc getopt_long_#t~ret504#1; [2025-03-17 18:59:25,254 INFO L? ?]: Removed 843 outVars from TransFormulas that were not future-live. [2025-03-17 18:59:25,254 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:59:25,292 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:59:25,293 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:59:25,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:59:25 BoogieIcfgContainer [2025-03-17 18:59:25,293 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:59:25,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:59:25,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:59:25,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:59:25,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:59:12" (1/3) ... [2025-03-17 18:59:25,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f022840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:59:25, skipping insertion in model container [2025-03-17 18:59:25,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:59:13" (2/3) ... [2025-03-17 18:59:25,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f022840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:59:25, skipping insertion in model container [2025-03-17 18:59:25,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:59:25" (3/3) ... [2025-03-17 18:59:25,301 INFO L128 eAbstractionObserver]: Analyzing ICFG touch-1.i [2025-03-17 18:59:25,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:59:25,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG touch-1.i that has 13 procedures, 727 locations, 1 initial locations, 30 loop locations, and 96 error locations. [2025-03-17 18:59:25,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:59:25,373 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;@79c214ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:59:25,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-03-17 18:59:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 727 states, 563 states have (on average 1.6642984014209592) internal successors, (937), 668 states have internal predecessors, (937), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-17 18:59:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:59:25,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:25,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:59:25,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:25,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1162771, now seen corresponding path program 1 times [2025-03-17 18:59:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540899688] [2025-03-17 18:59:25,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:25,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:26,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:59:26,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:59:26,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:26,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540899688] [2025-03-17 18:59:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540899688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:59:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:59:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146725707] [2025-03-17 18:59:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:26,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:59:26,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:26,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:59:26,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:26,806 INFO L87 Difference]: Start difference. First operand has 727 states, 563 states have (on average 1.6642984014209592) internal successors, (937), 668 states have internal predecessors, (937), 55 states have call successors, (55), 12 states have call predecessors, (55), 12 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:27,180 INFO L93 Difference]: Finished difference Result 1353 states and 2007 transitions. [2025-03-17 18:59:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:59:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 18:59:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:27,189 INFO L225 Difference]: With dead ends: 1353 [2025-03-17 18:59:27,189 INFO L226 Difference]: Without dead ends: 626 [2025-03-17 18:59:27,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:27,195 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:27,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1711 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 18:59:27,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-17 18:59:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2025-03-17 18:59:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 498 states have (on average 1.5923694779116466) internal successors, (793), 576 states have internal predecessors, (793), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:27,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 883 transitions. [2025-03-17 18:59:27,250 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 883 transitions. Word has length 3 [2025-03-17 18:59:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 883 transitions. [2025-03-17 18:59:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 883 transitions. [2025-03-17 18:59:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 18:59:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:27,250 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 18:59:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:59:27,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 281470877, now seen corresponding path program 1 times [2025-03-17 18:59:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:27,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552103769] [2025-03-17 18:59:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:27,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:59:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:59:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:28,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552103769] [2025-03-17 18:59:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552103769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:59:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278241211] [2025-03-17 18:59:28,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:59:28,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:59:28,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 18:59:29,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:59:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:59:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:29,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:59:29,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:59:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:29,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:59:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278241211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:29,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:59:29,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 18:59:29,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346532716] [2025-03-17 18:59:29,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:29,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:59:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:29,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:59:29,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:29,579 INFO L87 Difference]: Start difference. First operand 626 states and 883 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:33,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:59:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:34,001 INFO L93 Difference]: Finished difference Result 626 states and 883 transitions. [2025-03-17 18:59:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:59:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 18:59:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:34,004 INFO L225 Difference]: With dead ends: 626 [2025-03-17 18:59:34,005 INFO L226 Difference]: Without dead ends: 625 [2025-03-17 18:59:34,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:34,006 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:34,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1701 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 18:59:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-17 18:59:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2025-03-17 18:59:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 498 states have (on average 1.5903614457831325) internal successors, (792), 575 states have internal predecessors, (792), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 882 transitions. [2025-03-17 18:59:34,038 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 882 transitions. Word has length 6 [2025-03-17 18:59:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 882 transitions. [2025-03-17 18:59:34,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 882 transitions. [2025-03-17 18:59:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:59:34,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:34,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:59:34,049 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-17 18:59:34,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:34,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 135663701, now seen corresponding path program 1 times [2025-03-17 18:59:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:34,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351865855] [2025-03-17 18:59:34,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:34,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:34,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:59:34,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:59:34,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:34,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:59:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:35,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351865855] [2025-03-17 18:59:35,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351865855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:35,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:59:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:59:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833672687] [2025-03-17 18:59:35,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:35,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:59:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:35,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:59:35,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:35,119 INFO L87 Difference]: Start difference. First operand 625 states and 882 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:35,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:35,417 INFO L93 Difference]: Finished difference Result 625 states and 882 transitions. [2025-03-17 18:59:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:59:35,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 18:59:35,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:35,421 INFO L225 Difference]: With dead ends: 625 [2025-03-17 18:59:35,421 INFO L226 Difference]: Without dead ends: 624 [2025-03-17 18:59:35,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:35,421 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 0 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1702 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:35,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1702 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 18:59:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-17 18:59:35,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2025-03-17 18:59:35,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 496 states have (on average 1.590725806451613) internal successors, (789), 572 states have internal predecessors, (789), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 879 transitions. [2025-03-17 18:59:35,433 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 879 transitions. Word has length 7 [2025-03-17 18:59:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:35,434 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 879 transitions. [2025-03-17 18:59:35,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 18:59:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 879 transitions. [2025-03-17 18:59:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 18:59:35,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:35,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:59:35,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:59:35,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:35,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1900855045, now seen corresponding path program 1 times [2025-03-17 18:59:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:35,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655898554] [2025-03-17 18:59:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:36,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:59:36,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:59:36,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:36,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:36,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655898554] [2025-03-17 18:59:36,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655898554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:59:36,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647696443] [2025-03-17 18:59:36,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:36,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:59:36,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:59:36,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 18:59:37,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:59:37,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:59:37,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:37,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:37,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:59:37,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:59:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 18:59:37,780 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:59:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647696443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:59:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:59:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554959836] [2025-03-17 18:59:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:37,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:59:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:37,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:59:37,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:37,781 INFO L87 Difference]: Start difference. First operand 622 states and 879 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:41,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:59:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:42,085 INFO L93 Difference]: Finished difference Result 622 states and 879 transitions. [2025-03-17 18:59:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:59:42,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-17 18:59:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:42,088 INFO L225 Difference]: With dead ends: 622 [2025-03-17 18:59:42,088 INFO L226 Difference]: Without dead ends: 620 [2025-03-17 18:59:42,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:42,092 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 717 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:42,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 961 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 18:59:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-03-17 18:59:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2025-03-17 18:59:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 496 states have (on average 1.5866935483870968) internal successors, (787), 570 states have internal predecessors, (787), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 877 transitions. [2025-03-17 18:59:42,107 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 877 transitions. Word has length 11 [2025-03-17 18:59:42,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:42,107 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 877 transitions. [2025-03-17 18:59:42,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:42,108 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 877 transitions. [2025-03-17 18:59:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:59:42,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:42,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:59:42,118 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-17 18:59:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 18:59:42,309 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1203034649, now seen corresponding path program 1 times [2025-03-17 18:59:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373549508] [2025-03-17 18:59:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:42,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:59:43,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:59:43,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:43,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:43,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373549508] [2025-03-17 18:59:43,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373549508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:59:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591852240] [2025-03-17 18:59:43,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:43,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:43,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:59:43,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:59:43,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 18:59:44,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:59:44,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:59:44,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:44,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:59:44,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:59:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:44,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:59:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 18:59:44,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591852240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:59:44,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:59:44,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 18:59:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805672526] [2025-03-17 18:59:44,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:59:44,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:59:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:44,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:59:44,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:59:44,681 INFO L87 Difference]: Start difference. First operand 620 states and 877 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:59:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:45,164 INFO L93 Difference]: Finished difference Result 1244 states and 1760 transitions. [2025-03-17 18:59:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:59:45,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2025-03-17 18:59:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:45,167 INFO L225 Difference]: With dead ends: 1244 [2025-03-17 18:59:45,167 INFO L226 Difference]: Without dead ends: 629 [2025-03-17 18:59:45,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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-17 18:59:45,170 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 4 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:45,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2546 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 18:59:45,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-17 18:59:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2025-03-17 18:59:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 505 states have (on average 1.5762376237623763) internal successors, (796), 579 states have internal predecessors, (796), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 886 transitions. [2025-03-17 18:59:45,186 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 886 transitions. Word has length 12 [2025-03-17 18:59:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:45,186 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 886 transitions. [2025-03-17 18:59:45,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:59:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 886 transitions. [2025-03-17 18:59:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:59:45,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:45,187 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:59:45,198 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-17 18:59:45,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:45,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:45,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:45,389 INFO L85 PathProgramCache]: Analyzing trace with hash 295801693, now seen corresponding path program 2 times [2025-03-17 18:59:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:45,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350563452] [2025-03-17 18:59:45,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:59:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:46,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 18:59:46,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 18:59:46,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:59:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:59:46,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350563452] [2025-03-17 18:59:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350563452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:46,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:59:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:59:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128864372] [2025-03-17 18:59:46,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:46,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:59:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:46,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:59:46,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:46,545 INFO L87 Difference]: Start difference. First operand 629 states and 886 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:50,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:59:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:51,928 INFO L93 Difference]: Finished difference Result 629 states and 886 transitions. [2025-03-17 18:59:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:59:51,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-17 18:59:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:51,931 INFO L225 Difference]: With dead ends: 629 [2025-03-17 18:59:51,931 INFO L226 Difference]: Without dead ends: 627 [2025-03-17 18:59:51,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:59:51,932 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 716 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2530 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:51,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2530 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2025-03-17 18:59:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-17 18:59:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2025-03-17 18:59:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 505 states have (on average 1.5722772277227723) internal successors, (794), 577 states have internal predecessors, (794), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:51,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 884 transitions. [2025-03-17 18:59:51,946 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 884 transitions. Word has length 21 [2025-03-17 18:59:51,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:51,947 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 884 transitions. [2025-03-17 18:59:51,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:51,947 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 884 transitions. [2025-03-17 18:59:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 18:59:51,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:51,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:59:51,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:59:51,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:51,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2138530806, now seen corresponding path program 1 times [2025-03-17 18:59:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369741855] [2025-03-17 18:59:51,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:51,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:52,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 18:59:52,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 18:59:52,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:59:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369741855] [2025-03-17 18:59:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369741855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:59:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:59:52,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861826773] [2025-03-17 18:59:52,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:52,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:59:52,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:52,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:59:52,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:52,871 INFO L87 Difference]: Start difference. First operand 627 states and 884 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:56,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:59:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:57,245 INFO L93 Difference]: Finished difference Result 1238 states and 1753 transitions. [2025-03-17 18:59:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:59:57,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-17 18:59:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:57,250 INFO L225 Difference]: With dead ends: 1238 [2025-03-17 18:59:57,250 INFO L226 Difference]: Without dead ends: 630 [2025-03-17 18:59:57,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:57,252 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 1 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:57,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1691 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 18:59:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-03-17 18:59:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-03-17 18:59:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 508 states have (on average 1.5688976377952757) internal successors, (797), 580 states have internal predecessors, (797), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 887 transitions. [2025-03-17 18:59:57,268 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 887 transitions. Word has length 26 [2025-03-17 18:59:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:57,268 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 887 transitions. [2025-03-17 18:59:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 887 transitions. [2025-03-17 18:59:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 18:59:57,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:57,269 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-17 18:59:57,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:59:57,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:57,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1870284073, now seen corresponding path program 1 times [2025-03-17 18:59:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:57,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452510138] [2025-03-17 18:59:57,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 18:59:57,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 18:59:57,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:57,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:59:58,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:58,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452510138] [2025-03-17 18:59:58,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452510138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:59:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:59:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:59:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593405607] [2025-03-17 18:59:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:59:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:59:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:59:58,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:59:58,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:58,169 INFO L87 Difference]: Start difference. First operand 630 states and 887 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:59:58,636 INFO L93 Difference]: Finished difference Result 924 states and 1322 transitions. [2025-03-17 18:59:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:59:58,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-17 18:59:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:59:58,640 INFO L225 Difference]: With dead ends: 924 [2025-03-17 18:59:58,640 INFO L226 Difference]: Without dead ends: 922 [2025-03-17 18:59:58,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:59:58,641 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 407 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:59:58,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1678 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 18:59:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-17 18:59:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 634. [2025-03-17 18:59:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 512 states have (on average 1.56640625) internal successors, (802), 584 states have internal predecessors, (802), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:59:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 892 transitions. [2025-03-17 18:59:58,662 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 892 transitions. Word has length 27 [2025-03-17 18:59:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:59:58,662 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 892 transitions. [2025-03-17 18:59:58,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 18:59:58,662 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 892 transitions. [2025-03-17 18:59:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:59:58,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:59:58,662 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:59:58,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:59:58,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 18:59:58,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:59:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1720257482, now seen corresponding path program 1 times [2025-03-17 18:59:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:59:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86970697] [2025-03-17 18:59:58,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:59:59,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:59:59,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:59:59,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:59:59,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:59:59,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-17 18:59:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:59:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86970697] [2025-03-17 18:59:59,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86970697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:59:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524907419] [2025-03-17 18:59:59,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:59:59,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:59:59,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:59:59,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:59:59,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:00:00,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 19:00:00,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 19:00:00,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:00,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 19:00:00,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:00:01,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:00:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:00:02,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524907419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:00:02,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:00:02,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 19:00:02,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601951048] [2025-03-17 19:00:02,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:00:02,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 19:00:02,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:02,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:00:02,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:00:02,265 INFO L87 Difference]: Start difference. First operand 634 states and 892 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:00:06,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:10,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:11,378 INFO L93 Difference]: Finished difference Result 1271 states and 1793 transitions. [2025-03-17 19:00:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:00:11,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-17 19:00:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:11,381 INFO L225 Difference]: With dead ends: 1271 [2025-03-17 19:00:11,381 INFO L226 Difference]: Without dead ends: 651 [2025-03-17 19:00:11,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:00:11,384 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 5 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:11,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3362 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-17 19:00:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-17 19:00:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2025-03-17 19:00:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 530 states have (on average 1.5452830188679245) internal successors, (819), 601 states have internal predecessors, (819), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 19:00:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 909 transitions. [2025-03-17 19:00:11,403 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 909 transitions. Word has length 29 [2025-03-17 19:00:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:11,404 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 909 transitions. [2025-03-17 19:00:11,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 19:00:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 909 transitions. [2025-03-17 19:00:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-17 19:00:11,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:11,405 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] [2025-03-17 19:00:11,417 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-17 19:00:11,606 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-17 19:00:11,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 19:00:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1195620650, now seen corresponding path program 1 times [2025-03-17 19:00:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195733363] [2025-03-17 19:00:11,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:12,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-17 19:00:12,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-17 19:00:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 19:00:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195733363] [2025-03-17 19:00:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195733363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:00:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096320413] [2025-03-17 19:00:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:12,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:12,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:12,648 INFO L87 Difference]: Start difference. First operand 651 states and 909 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 19:00:16,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:17,220 INFO L93 Difference]: Finished difference Result 663 states and 923 transitions. [2025-03-17 19:00:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-03-17 19:00:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:17,223 INFO L225 Difference]: With dead ends: 663 [2025-03-17 19:00:17,223 INFO L226 Difference]: Without dead ends: 661 [2025-03-17 19:00:17,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:17,223 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 2 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:17,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1686 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 19:00:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-03-17 19:00:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 660. [2025-03-17 19:00:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 539 states have (on average 1.5417439703153988) internal successors, (831), 610 states have internal predecessors, (831), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 19:00:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 921 transitions. [2025-03-17 19:00:17,239 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 921 transitions. Word has length 47 [2025-03-17 19:00:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:17,239 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 921 transitions. [2025-03-17 19:00:17,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 19:00:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 921 transitions. [2025-03-17 19:00:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 19:00:17,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:17,242 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:00:17,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 19:00:17,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:17,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1590471564, now seen corresponding path program 1 times [2025-03-17 19:00:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304959716] [2025-03-17 19:00:17,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 19:00:17,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 19:00:17,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:18,138 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-17 19:00:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304959716] [2025-03-17 19:00:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304959716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:00:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:00:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456459575] [2025-03-17 19:00:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:00:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:18,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:00:18,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:18,139 INFO L87 Difference]: Start difference. First operand 660 states and 921 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-17 19:00:22,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:22,571 INFO L93 Difference]: Finished difference Result 660 states and 921 transitions. [2025-03-17 19:00:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:00:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-03-17 19:00:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:22,574 INFO L225 Difference]: With dead ends: 660 [2025-03-17 19:00:22,574 INFO L226 Difference]: Without dead ends: 659 [2025-03-17 19:00:22,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:00:22,574 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:22,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1689 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 19:00:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-17 19:00:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2025-03-17 19:00:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 535 states have (on average 1.5420560747663552) internal successors, (825), 605 states have internal predecessors, (825), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 19:00:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 915 transitions. [2025-03-17 19:00:22,590 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 915 transitions. Word has length 48 [2025-03-17 19:00:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:22,590 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 915 transitions. [2025-03-17 19:00:22,590 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-17 19:00:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 915 transitions. [2025-03-17 19:00:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 19:00:22,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:22,592 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-17 19:00:22,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:00:22,592 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 19:00:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1948614299, now seen corresponding path program 1 times [2025-03-17 19:00:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:22,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560891516] [2025-03-17 19:00:22,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:22,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:23,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 19:00:23,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:00:23,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:23,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:00:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560891516] [2025-03-17 19:00:23,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560891516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128130983] [2025-03-17 19:00:23,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:23,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:23,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:23,606 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-17 19:00:23,607 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-17 19:00:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 19:00:24,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 19:00:24,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:24,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:25,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:00:25,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:00:25,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:00:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128130983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:00:25,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:00:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 19:00:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508371309] [2025-03-17 19:00:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:00:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:00:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:25,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:00:25,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:25,152 INFO L87 Difference]: Start difference. First operand 655 states and 915 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-17 19:00:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:25,938 INFO L93 Difference]: Finished difference Result 947 states and 1349 transitions. [2025-03-17 19:00:25,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:00:25,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-17 19:00:25,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:25,941 INFO L225 Difference]: With dead ends: 947 [2025-03-17 19:00:25,941 INFO L226 Difference]: Without dead ends: 946 [2025-03-17 19:00:25,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:00:25,943 INFO L435 NwaCegarLoop]: 1244 mSDtfsCounter, 813 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:25,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2084 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 19:00:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-17 19:00:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 654. [2025-03-17 19:00:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 535 states have (on average 1.5401869158878505) internal successors, (824), 604 states have internal predecessors, (824), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 19:00:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 914 transitions. [2025-03-17 19:00:25,960 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 914 transitions. Word has length 49 [2025-03-17 19:00:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:25,960 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 914 transitions. [2025-03-17 19:00:25,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 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-17 19:00:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 914 transitions. [2025-03-17 19:00:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 19:00:25,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:25,961 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:00:25,973 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-17 19:00:26,161 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-17 19:00:26,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 19:00:26,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 277502201, now seen corresponding path program 1 times [2025-03-17 19:00:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919865037] [2025-03-17 19:00:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:26,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:00:26,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:00:26,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:26,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:00:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919865037] [2025-03-17 19:00:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919865037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121504517] [2025-03-17 19:00:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:27,160 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-17 19:00:27,161 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-17 19:00:28,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 19:00:28,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 19:00:28,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:28,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:28,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 2233 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:00:28,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:00:28,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:00:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 19:00:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121504517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:00:28,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:00:28,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 19:00:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515998452] [2025-03-17 19:00:28,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:00:28,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:00:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:28,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:00:28,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:00:28,932 INFO L87 Difference]: Start difference. First operand 654 states and 914 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) 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-17 19:00:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:00:30,536 INFO L93 Difference]: Finished difference Result 1819 states and 2644 transitions. [2025-03-17 19:00:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:00:30,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) 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 50 [2025-03-17 19:00:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:00:30,542 INFO L225 Difference]: With dead ends: 1819 [2025-03-17 19:00:30,542 INFO L226 Difference]: Without dead ends: 1818 [2025-03-17 19:00:30,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:00:30,543 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 2436 mSDsluCounter, 3883 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:00:30,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 4723 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 19:00:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2025-03-17 19:00:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 666. [2025-03-17 19:00:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 547 states have (on average 1.5338208409506398) internal successors, (839), 616 states have internal predecessors, (839), 51 states have call successors, (51), 12 states have call predecessors, (51), 10 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 19:00:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 929 transitions. [2025-03-17 19:00:30,562 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 929 transitions. Word has length 50 [2025-03-17 19:00:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:00:30,563 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 929 transitions. [2025-03-17 19:00:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) 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-17 19:00:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 929 transitions. [2025-03-17 19:00:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 19:00:30,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:00:30,564 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] [2025-03-17 19:00:30,576 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-17 19:00:30,765 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-17 19:00:30,765 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW === [bb_ascii_isalnumErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, bb_ascii_isalnumErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 93 more)] === [2025-03-17 19:00:30,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:00:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1657899362, now seen corresponding path program 1 times [2025-03-17 19:00:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:00:30,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98723349] [2025-03-17 19:00:30,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:00:31,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 19:00:31,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 19:00:31,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:31,730 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-17 19:00:31,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:00:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98723349] [2025-03-17 19:00:31,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98723349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:00:31,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578818717] [2025-03-17 19:00:31,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:00:31,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:00:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:00:31,732 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-17 19:00:31,734 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-17 19:00:32,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 19:00:33,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 19:00:33,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:00:33,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:00:33,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 2196 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:00:33,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:00:33,264 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-17 19:00:33,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:00:33,426 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-17 19:00:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578818717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:00:33,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:00:33,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 19:00:33,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109778931] [2025-03-17 19:00:33,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:00:33,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:00:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:00:33,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:00:33,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:00:33,427 INFO L87 Difference]: Start difference. First operand 666 states and 929 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 19:00:37,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:41,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 19:00:45,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []