./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-2.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/rm-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 18:57:32,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 18:57:32,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 18:57:32,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 18:57:32,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 18:57:32,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 18:57:32,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 18:57:32,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 18:57:32,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 18:57:32,654 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 18:57:32,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 18:57:32,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 18:57:32,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 18:57:32,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 18:57:32,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 18:57:32,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 18:57:32,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 18:57:32,657 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:57:32,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 18:57:32,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 18:57:32,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 18:57:32,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 18:57:32,659 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 -> 90737e7de37f377d29635b0f8c6eb5502f274919cfcd178c0f93945dfec4ae40 [2025-03-17 18:57:32,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 18:57:32,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 18:57:32,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 18:57:32,886 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 18:57:32,887 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 18:57:32,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-03-17 18:57:34,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fae7e202/9542da00a9ab4396ad8cce1bed0b58ad/FLAG7f1a6b22d [2025-03-17 18:57:34,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 18:57:34,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-2.i [2025-03-17 18:57:34,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fae7e202/9542da00a9ab4396ad8cce1bed0b58ad/FLAG7f1a6b22d [2025-03-17 18:57:34,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fae7e202/9542da00a9ab4396ad8cce1bed0b58ad [2025-03-17 18:57:34,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 18:57:34,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 18:57:34,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 18:57:34,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 18:57:34,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 18:57:34,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:57:34" (1/1) ... [2025-03-17 18:57:34,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab0391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:34, skipping insertion in model container [2025-03-17 18:57:34,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:57:34" (1/1) ... [2025-03-17 18:57:34,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 18:57:35,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:57:35,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 18:57:35,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 18:57:35,644 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 18:57:35,654 INFO L204 MainTranslator]: Completed translation [2025-03-17 18:57:35,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35 WrapperNode [2025-03-17 18:57:35,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 18:57:35,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 18:57:35,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 18:57:35,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 18:57:35,660 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:57:35" (1/1) ... [2025-03-17 18:57:35,712 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:57:35" (1/1) ... [2025-03-17 18:57:35,796 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2806 [2025-03-17 18:57:35,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 18:57:35,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 18:57:35,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 18:57:35,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 18:57:35,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,856 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 18:57:35,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,917 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 18:57:35,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 18:57:35,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 18:57:35,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 18:57:35,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (1/1) ... [2025-03-17 18:57:35,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 18:57:35,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:35,987 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:57:35,990 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:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-03-17 18:57:36,008 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-03-17 18:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-17 18:57:36,008 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-17 18:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 18:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 18:57:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-17 18:57:36,008 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-03-17 18:57:36,009 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 18:57:36,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 18:57:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 18:57:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-17 18:57:36,010 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-17 18:57:36,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 18:57:36,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 18:57:36,441 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3564: havoc #t~nondet287; [2025-03-17 18:57:36,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc ~dp~0#1.base, ~dp~0#1.offset, ~d~0#1.base, ~d~0#1.offset, ~status~0#1, ~return_value_closedir$8~0#1, ~return_value_rmdir$10~0#1; [2025-03-17 18:57:36,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc lstat_#t~ret332#1; [2025-03-17 18:57:36,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: call ULTIMATE.dealloc(~#path_stat~0#1.base, ~#path_stat~0#1.offset);havoc ~#path_stat~0#1.base, ~#path_stat~0#1.offset; [2025-03-17 18:57:36,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3443: havoc xasprintf_#t~mem260#1.base, xasprintf_#t~mem260#1.offset;call ULTIMATE.dealloc(xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset);havoc xasprintf_~#string_ptr~0#1.base, xasprintf_~#string_ptr~0#1.offset; [2025-03-17 18:57:36,940 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3652: havoc stat_#t~ret331#1; [2025-03-17 18:57:39,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2779: 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:57:39,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc getopt_long_#t~ret364#1; [2025-03-17 18:57:39,312 INFO L? ?]: Removed 744 outVars from TransFormulas that were not future-live. [2025-03-17 18:57:39,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 18:57:39,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 18:57:39,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 18:57:39,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:57:39 BoogieIcfgContainer [2025-03-17 18:57:39,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 18:57:39,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 18:57:39,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 18:57:39,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 18:57:39,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:57:34" (1/3) ... [2025-03-17 18:57:39,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7ad2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:57:39, skipping insertion in model container [2025-03-17 18:57:39,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:57:35" (2/3) ... [2025-03-17 18:57:39,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7ad2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:57:39, skipping insertion in model container [2025-03-17 18:57:39,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:57:39" (3/3) ... [2025-03-17 18:57:39,375 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-2.i [2025-03-17 18:57:39,386 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 18:57:39,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-2.i that has 16 procedures, 702 locations, 1 initial locations, 34 loop locations, and 70 error locations. [2025-03-17 18:57:39,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 18:57:39,461 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;@34f65e0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 18:57:39,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2025-03-17 18:57:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand has 702 states, 566 states have (on average 1.6342756183745584) internal successors, (925), 642 states have internal predecessors, (925), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 18:57:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 18:57:39,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:39,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 18:57:39,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1181638, now seen corresponding path program 1 times [2025-03-17 18:57:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:39,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182385394] [2025-03-17 18:57:39,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:39,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:39,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 18:57:39,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 18:57:39,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:39,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:40,272 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:57:40,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182385394] [2025-03-17 18:57:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182385394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 18:57:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815279831] [2025-03-17 18:57:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:40,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:40,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:40,292 INFO L87 Difference]: Start difference. First operand has 702 states, 566 states have (on average 1.6342756183745584) internal successors, (925), 642 states have internal predecessors, (925), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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:57:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:40,485 INFO L93 Difference]: Finished difference Result 1301 states and 1951 transitions. [2025-03-17 18:57:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:40,487 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:57:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:40,495 INFO L225 Difference]: With dead ends: 1301 [2025-03-17 18:57:40,495 INFO L226 Difference]: Without dead ends: 600 [2025-03-17 18:57:40,502 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:57:40,503 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:40,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1635 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:57:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-17 18:57:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-17 18:57:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 499 states have (on average 1.5531062124248498) internal successors, (775), 549 states have internal predecessors, (775), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 858 transitions. [2025-03-17 18:57:40,578 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 858 transitions. Word has length 3 [2025-03-17 18:57:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:40,578 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 858 transitions. [2025-03-17 18:57:40,579 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:57:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 858 transitions. [2025-03-17 18:57:40,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 18:57:40,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:40,580 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 18:57:40,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 18:57:40,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:40,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:40,581 INFO L85 PathProgramCache]: Analyzing trace with hash 843556541, now seen corresponding path program 1 times [2025-03-17 18:57:40,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:40,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376962747] [2025-03-17 18:57:40,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:40,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:40,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:57:40,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:57:40,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:40,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:41,014 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:57:41,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:41,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376962747] [2025-03-17 18:57:41,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376962747] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:41,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458970321] [2025-03-17 18:57:41,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:41,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:41,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:41,017 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:57:41,019 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:57:41,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 18:57:41,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 18:57:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:41,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1734 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:41,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:41,581 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:57:41,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458970321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2025-03-17 18:57:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137071451] [2025-03-17 18:57:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:57:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:41,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:57:41,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:41,583 INFO L87 Difference]: Start difference. First operand 600 states and 858 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:57:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:42,387 INFO L93 Difference]: Finished difference Result 600 states and 858 transitions. [2025-03-17 18:57:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:57:42,388 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:57:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:42,390 INFO L225 Difference]: With dead ends: 600 [2025-03-17 18:57:42,391 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 18:57:42,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:42,392 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:42,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2440 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 18:57:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 18:57:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-17 18:57:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 499 states have (on average 1.5511022044088176) internal successors, (774), 548 states have internal predecessors, (774), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:42,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 857 transitions. [2025-03-17 18:57:42,414 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 857 transitions. Word has length 6 [2025-03-17 18:57:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:42,414 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 857 transitions. [2025-03-17 18:57:42,415 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:57:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 857 transitions. [2025-03-17 18:57:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 18:57:42,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:42,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2025-03-17 18:57:42,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 18:57:42,620 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:57:42,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:42,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 380450120, now seen corresponding path program 1 times [2025-03-17 18:57:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733169514] [2025-03-17 18:57:42,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:42,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 18:57:42,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 18:57:42,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:42,987 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:57:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733169514] [2025-03-17 18:57:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733169514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5239015] [2025-03-17 18:57:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:42,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:42,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:42,989 INFO L87 Difference]: Start difference. First operand 599 states and 857 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:57:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:43,096 INFO L93 Difference]: Finished difference Result 599 states and 857 transitions. [2025-03-17 18:57:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:43,097 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:57:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:43,099 INFO L225 Difference]: With dead ends: 599 [2025-03-17 18:57:43,099 INFO L226 Difference]: Without dead ends: 598 [2025-03-17 18:57:43,100 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:57:43,100 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:43,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1628 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:57:43,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-03-17 18:57:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2025-03-17 18:57:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 497 states have (on average 1.551307847082495) internal successors, (771), 545 states have internal predecessors, (771), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 854 transitions. [2025-03-17 18:57:43,123 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 854 transitions. Word has length 7 [2025-03-17 18:57:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:43,123 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 854 transitions. [2025-03-17 18:57:43,124 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:57:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 854 transitions. [2025-03-17 18:57:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 18:57:43,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:43,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 18:57:43,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1674328993, now seen corresponding path program 1 times [2025-03-17 18:57:43,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998042882] [2025-03-17 18:57:43,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:43,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:57:43,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:57:43,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:43,516 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:57:43,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998042882] [2025-03-17 18:57:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998042882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776457968] [2025-03-17 18:57:43,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:43,519 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:57:43,521 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:57:43,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 18:57:44,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 18:57:44,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:44,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:57:44,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:44,025 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:57:44,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:44,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776457968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:44,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:44,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:57:44,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137720894] [2025-03-17 18:57:44,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:44,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:44,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:44,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:44,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:44,026 INFO L87 Difference]: Start difference. First operand 596 states and 854 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:57:45,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:45,111 INFO L93 Difference]: Finished difference Result 596 states and 854 transitions. [2025-03-17 18:57:45,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:45,111 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:57:45,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:45,113 INFO L225 Difference]: With dead ends: 596 [2025-03-17 18:57:45,113 INFO L226 Difference]: Without dead ends: 594 [2025-03-17 18:57:45,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:45,114 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 523 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:45,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1109 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 18:57:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2025-03-17 18:57:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2025-03-17 18:57:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 497 states have (on average 1.5472837022132797) internal successors, (769), 543 states have internal predecessors, (769), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 852 transitions. [2025-03-17 18:57:45,137 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 852 transitions. Word has length 11 [2025-03-17 18:57:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 852 transitions. [2025-03-17 18:57:45,138 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:57:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 852 transitions. [2025-03-17 18:57:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 18:57:45,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:45,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:45,147 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:57:45,338 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:57:45,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 364592350, now seen corresponding path program 1 times [2025-03-17 18:57:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:45,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479471388] [2025-03-17 18:57:45,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:45,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:57:45,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:57:45,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:45,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:45,697 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:57:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479471388] [2025-03-17 18:57:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479471388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362866457] [2025-03-17 18:57:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:45,699 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:57:45,702 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:57:46,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 18:57:46,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 18:57:46,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:46,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:46,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:46,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:46,239 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:57:46,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:46,268 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:57:46,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362866457] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:46,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:46,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-17 18:57:46,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707676164] [2025-03-17 18:57:46,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:46,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:57:46,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:46,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:57:46,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:46,269 INFO L87 Difference]: Start difference. First operand 594 states and 852 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:57:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:46,396 INFO L93 Difference]: Finished difference Result 1192 states and 1710 transitions. [2025-03-17 18:57:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:57:46,396 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:57:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:46,399 INFO L225 Difference]: With dead ends: 1192 [2025-03-17 18:57:46,399 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 18:57:46,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:46,400 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 4 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3246 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:46,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3246 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:57:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 18:57:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2025-03-17 18:57:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 506 states have (on average 1.5375494071146245) internal successors, (778), 552 states have internal predecessors, (778), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 861 transitions. [2025-03-17 18:57:46,418 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 861 transitions. Word has length 12 [2025-03-17 18:57:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 861 transitions. [2025-03-17 18:57:46,418 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:57:46,419 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 861 transitions. [2025-03-17 18:57:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 18:57:46,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:46,419 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:46,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 18:57:46,620 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:57:46,621 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:46,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1187978343, now seen corresponding path program 2 times [2025-03-17 18:57:46,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882685320] [2025-03-17 18:57:46,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:57:46,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:46,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-17 18:57:46,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 21 statements. [2025-03-17 18:57:46,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:57:46,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:47,048 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:57:47,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:47,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882685320] [2025-03-17 18:57:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882685320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 18:57:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801577990] [2025-03-17 18:57:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:57:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:47,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:57:47,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:47,049 INFO L87 Difference]: Start difference. First operand 603 states and 861 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:57:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:47,821 INFO L93 Difference]: Finished difference Result 603 states and 861 transitions. [2025-03-17 18:57:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:57:47,821 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:57:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:47,824 INFO L225 Difference]: With dead ends: 603 [2025-03-17 18:57:47,824 INFO L226 Difference]: Without dead ends: 601 [2025-03-17 18:57:47,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:47,824 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 522 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:47,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 2658 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-17 18:57:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-17 18:57:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 506 states have (on average 1.533596837944664) internal successors, (776), 550 states have internal predecessors, (776), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 859 transitions. [2025-03-17 18:57:47,841 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 859 transitions. Word has length 21 [2025-03-17 18:57:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:47,842 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 859 transitions. [2025-03-17 18:57:47,842 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:57:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 859 transitions. [2025-03-17 18:57:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 18:57:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:47,842 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:57:47,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 18:57:47,843 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:47,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:47,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1502467059, now seen corresponding path program 1 times [2025-03-17 18:57:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830428732] [2025-03-17 18:57:47,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:47,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 18:57:48,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 18:57:48,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:48,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:48,133 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:57:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830428732] [2025-03-17 18:57:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830428732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 18:57:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196870061] [2025-03-17 18:57:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:48,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:48,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:48,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:48,134 INFO L87 Difference]: Start difference. First operand 601 states and 859 transitions. Second operand has 3 states, 3 states have (on average 5.0) 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:57:49,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:57:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:49,351 INFO L93 Difference]: Finished difference Result 1186 states and 1703 transitions. [2025-03-17 18:57:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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:57:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:49,356 INFO L225 Difference]: With dead ends: 1186 [2025-03-17 18:57:49,356 INFO L226 Difference]: Without dead ends: 604 [2025-03-17 18:57:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:49,359 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 2 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:49,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1617 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 18:57:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-17 18:57:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-17 18:57:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 509 states have (on average 1.530451866404715) internal successors, (779), 553 states have internal predecessors, (779), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 862 transitions. [2025-03-17 18:57:49,375 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 862 transitions. Word has length 26 [2025-03-17 18:57:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 862 transitions. [2025-03-17 18:57:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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:57:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 862 transitions. [2025-03-17 18:57:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 18:57:49,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:49,376 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:57:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 18:57:49,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -668494975, now seen corresponding path program 1 times [2025-03-17 18:57:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827525913] [2025-03-17 18:57:49,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:49,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 18:57:49,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 18:57:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:49,756 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:57:49,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:49,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827525913] [2025-03-17 18:57:49,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827525913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:49,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:49,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:49,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941313677] [2025-03-17 18:57:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:49,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:49,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:49,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:49,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:49,758 INFO L87 Difference]: Start difference. First operand 604 states and 862 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:57:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:49,879 INFO L93 Difference]: Finished difference Result 898 states and 1297 transitions. [2025-03-17 18:57:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:49,879 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:57:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:49,884 INFO L225 Difference]: With dead ends: 898 [2025-03-17 18:57:49,885 INFO L226 Difference]: Without dead ends: 896 [2025-03-17 18:57:49,885 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:57:49,886 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 407 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:49,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1604 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:57:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-03-17 18:57:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 608. [2025-03-17 18:57:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 513 states have (on average 1.5282651072124755) internal successors, (784), 557 states have internal predecessors, (784), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 867 transitions. [2025-03-17 18:57:49,906 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 867 transitions. Word has length 27 [2025-03-17 18:57:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:49,906 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 867 transitions. [2025-03-17 18:57:49,907 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:57:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 867 transitions. [2025-03-17 18:57:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:57:49,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:49,907 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:49,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 18:57:49,908 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2147136480, now seen corresponding path program 1 times [2025-03-17 18:57:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636218701] [2025-03-17 18:57:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:50,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:50,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:50,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:50,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 18:57:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636218701] [2025-03-17 18:57:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636218701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845963666] [2025-03-17 18:57:50,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:50,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:50,233 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:57:50,235 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 18:57:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:50,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:50,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:50,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:50,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1919 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 18:57:50,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 18:57:50,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845963666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 18:57:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511131808] [2025-03-17 18:57:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:50,802 INFO L87 Difference]: Start difference. First operand 608 states and 867 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 18:57:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:51,500 INFO L93 Difference]: Finished difference Result 608 states and 867 transitions. [2025-03-17 18:57:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:51,501 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 29 [2025-03-17 18:57:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:51,503 INFO L225 Difference]: With dead ends: 608 [2025-03-17 18:57:51,503 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 18:57:51,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:51,504 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 3 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:51,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1607 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 18:57:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-17 18:57:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 513 states have (on average 1.5263157894736843) internal successors, (783), 556 states have internal predecessors, (783), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 866 transitions. [2025-03-17 18:57:51,518 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 866 transitions. Word has length 29 [2025-03-17 18:57:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:51,518 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 866 transitions. [2025-03-17 18:57:51,518 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 18:57:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 866 transitions. [2025-03-17 18:57:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 18:57:51,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:51,519 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:57:51,533 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 18:57:51,719 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 18:57:51,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:51,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2147136320, now seen corresponding path program 1 times [2025-03-17 18:57:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912743743] [2025-03-17 18:57:51,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:51,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:51,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:51,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:51,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:52,054 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:57:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912743743] [2025-03-17 18:57:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912743743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356604274] [2025-03-17 18:57:52,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:52,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:52,058 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 18:57:52,060 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 18:57:52,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 18:57:52,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 18:57:52,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:52,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:57:52,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:52,661 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 18:57:52,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:52,731 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 18:57:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356604274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:52,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 7] total 14 [2025-03-17 18:57:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504122458] [2025-03-17 18:57:52,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 18:57:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:52,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 18:57:52,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:57:52,732 INFO L87 Difference]: Start difference. First operand 607 states and 866 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 18:57:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:53,701 INFO L93 Difference]: Finished difference Result 1217 states and 1741 transitions. [2025-03-17 18:57:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 18:57:53,702 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 18:57:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:53,704 INFO L225 Difference]: With dead ends: 1217 [2025-03-17 18:57:53,705 INFO L226 Difference]: Without dead ends: 624 [2025-03-17 18:57:53,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 18:57:53,707 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 5 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4012 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:53,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4012 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 18:57:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-17 18:57:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-03-17 18:57:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 531 states have (on average 1.5065913370998116) internal successors, (800), 573 states have internal predecessors, (800), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 883 transitions. [2025-03-17 18:57:53,722 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 883 transitions. Word has length 29 [2025-03-17 18:57:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 883 transitions. [2025-03-17 18:57:53,722 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 18:57:53,723 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 883 transitions. [2025-03-17 18:57:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:57:53,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:53,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:53,734 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 18:57:53,925 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,SelfDestructingSolverStorable9 [2025-03-17 18:57:53,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:53,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash -559784368, now seen corresponding path program 1 times [2025-03-17 18:57:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:53,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403108032] [2025-03-17 18:57:53,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:53,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:54,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:57:54,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:57:54,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:54,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:54,240 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 18:57:54,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403108032] [2025-03-17 18:57:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403108032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:54,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163454613] [2025-03-17 18:57:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:54,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:54,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:54,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:54,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:54,242 INFO L87 Difference]: Start difference. First operand 624 states and 883 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 18:57:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:54,981 INFO L93 Difference]: Finished difference Result 635 states and 896 transitions. [2025-03-17 18:57:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:54,981 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 18:57:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:54,984 INFO L225 Difference]: With dead ends: 635 [2025-03-17 18:57:54,984 INFO L226 Difference]: Without dead ends: 634 [2025-03-17 18:57:54,984 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:57:54,984 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 1 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:54,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1611 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:54,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-17 18:57:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 633. [2025-03-17 18:57:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 540 states have (on average 1.5037037037037038) internal successors, (812), 582 states have internal predecessors, (812), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 895 transitions. [2025-03-17 18:57:55,003 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 895 transitions. Word has length 48 [2025-03-17 18:57:55,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:55,003 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 895 transitions. [2025-03-17 18:57:55,003 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 18:57:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 895 transitions. [2025-03-17 18:57:55,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 18:57:55,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:55,005 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 18:57:55,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 18:57:55,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:55,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:55,006 INFO L85 PathProgramCache]: Analyzing trace with hash -559779403, now seen corresponding path program 1 times [2025-03-17 18:57:55,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:55,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323007228] [2025-03-17 18:57:55,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:55,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:55,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 18:57:55,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 18:57:55,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:55,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:55,277 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 18:57:55,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:55,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323007228] [2025-03-17 18:57:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323007228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:57:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:57:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696387240] [2025-03-17 18:57:55,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:55,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:57:55,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:55,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:57:55,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:57:55,279 INFO L87 Difference]: Start difference. First operand 633 states and 895 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 18:57:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:55,948 INFO L93 Difference]: Finished difference Result 633 states and 895 transitions. [2025-03-17 18:57:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:57:55,949 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 18:57:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:55,952 INFO L225 Difference]: With dead ends: 633 [2025-03-17 18:57:55,952 INFO L226 Difference]: Without dead ends: 632 [2025-03-17 18:57:55,952 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:57:55,952 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 0 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:55,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1613 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 18:57:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-17 18:57:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 628. [2025-03-17 18:57:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 536 states have (on average 1.5037313432835822) internal successors, (806), 577 states have internal predecessors, (806), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 889 transitions. [2025-03-17 18:57:55,966 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 889 transitions. Word has length 48 [2025-03-17 18:57:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:55,966 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 889 transitions. [2025-03-17 18:57:55,966 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 18:57:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 889 transitions. [2025-03-17 18:57:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 18:57:55,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:55,968 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 18:57:55,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 18:57:55,968 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:55,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -284656219, now seen corresponding path program 1 times [2025-03-17 18:57:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:55,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014332782] [2025-03-17 18:57:55,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:56,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 18:57:56,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 18:57:56,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:56,286 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 18:57:56,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:56,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014332782] [2025-03-17 18:57:56,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014332782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:56,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394938966] [2025-03-17 18:57:56,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:56,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:56,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:56,288 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 18:57:56,290 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 18:57:56,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 18:57:56,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 18:57:56,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:56,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:56,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 2057 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:56,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:56,855 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 18:57:56,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:57:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394938966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:57:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:57:56,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 18:57:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547127062] [2025-03-17 18:57:56,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:57:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:57:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:56,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:57:56,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:56,857 INFO L87 Difference]: Start difference. First operand 628 states and 889 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 18:57:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:56,998 INFO L93 Difference]: Finished difference Result 920 states and 1323 transitions. [2025-03-17 18:57:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:57:56,999 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 18:57:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:57,003 INFO L225 Difference]: With dead ends: 920 [2025-03-17 18:57:57,004 INFO L226 Difference]: Without dead ends: 919 [2025-03-17 18:57:57,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 18:57:57,005 INFO L435 NwaCegarLoop]: 1206 mSDtfsCounter, 813 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:57,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2008 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:57:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2025-03-17 18:57:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 627. [2025-03-17 18:57:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 536 states have (on average 1.501865671641791) internal successors, (805), 576 states have internal predecessors, (805), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 888 transitions. [2025-03-17 18:57:57,022 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 888 transitions. Word has length 49 [2025-03-17 18:57:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:57,023 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 888 transitions. [2025-03-17 18:57:57,023 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 18:57:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 888 transitions. [2025-03-17 18:57:57,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 18:57:57,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:57,024 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 18:57:57,035 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 18:57:57,225 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 18:57:57,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:57,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:57,225 INFO L85 PathProgramCache]: Analyzing trace with hash -234407102, now seen corresponding path program 1 times [2025-03-17 18:57:57,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:57,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061820008] [2025-03-17 18:57:57,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:57,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 18:57:57,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 18:57:57,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:57,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:57,545 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 18:57:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061820008] [2025-03-17 18:57:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061820008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68476240] [2025-03-17 18:57:57,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:57,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:57,548 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 18:57:57,549 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 18:57:57,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 18:57:58,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 18:57:58,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:58,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:58,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:58,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:58,126 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 18:57:58,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:58,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 18:57:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68476240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:58,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:58,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 18:57:58,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702760783] [2025-03-17 18:57:58,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:58,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:57:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:58,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:57:58,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:58,157 INFO L87 Difference]: Start difference. First operand 627 states and 888 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 18:57:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:57:58,505 INFO L93 Difference]: Finished difference Result 1792 states and 2618 transitions. [2025-03-17 18:57:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:57:58,506 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 18:57:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:57:58,511 INFO L225 Difference]: With dead ends: 1792 [2025-03-17 18:57:58,512 INFO L226 Difference]: Without dead ends: 1791 [2025-03-17 18:57:58,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:58,512 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 2091 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:57:58,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 4219 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 18:57:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-17 18:57:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 639. [2025-03-17 18:57:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 548 states have (on average 1.4963503649635037) internal successors, (820), 588 states have internal predecessors, (820), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:57:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 903 transitions. [2025-03-17 18:57:58,538 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 903 transitions. Word has length 50 [2025-03-17 18:57:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:57:58,538 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 903 transitions. [2025-03-17 18:57:58,538 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 18:57:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 903 transitions. [2025-03-17 18:57:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 18:57:58,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:57:58,539 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:57:58,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 18:57:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:58,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:57:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:57:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -934906427, now seen corresponding path program 1 times [2025-03-17 18:57:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:57:58,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274008376] [2025-03-17 18:57:58,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:57:58,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:57:58,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:57:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:59,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:57:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274008376] [2025-03-17 18:57:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274008376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:57:59,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279227788] [2025-03-17 18:57:59,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:57:59,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:57:59,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:57:59,075 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:57:59,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 18:57:59,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 18:57:59,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 18:57:59,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:57:59,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:57:59,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:57:59,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:57:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:59,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:57:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 18:57:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279227788] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:57:59,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:57:59,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 18:57:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386090518] [2025-03-17 18:57:59,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:57:59,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 18:57:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:57:59,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 18:57:59,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:57:59,695 INFO L87 Difference]: Start difference. First operand 639 states and 903 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 18:58:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:00,927 INFO L93 Difference]: Finished difference Result 1254 states and 1784 transitions. [2025-03-17 18:58:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:58:00,928 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 55 [2025-03-17 18:58:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:00,930 INFO L225 Difference]: With dead ends: 1254 [2025-03-17 18:58:00,930 INFO L226 Difference]: Without dead ends: 657 [2025-03-17 18:58:00,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 18:58:00,931 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 4 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:00,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2415 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 18:58:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-03-17 18:58:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2025-03-17 18:58:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 566 states have (on average 1.480565371024735) internal successors, (838), 606 states have internal predecessors, (838), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 18:58:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 921 transitions. [2025-03-17 18:58:00,977 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 921 transitions. Word has length 55 [2025-03-17 18:58:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:00,977 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 921 transitions. [2025-03-17 18:58:00,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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 18:58:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 921 transitions. [2025-03-17 18:58:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 18:58:00,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:00,978 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:00,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 18:58:01,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 18:58:01,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:01,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash -575456046, now seen corresponding path program 1 times [2025-03-17 18:58:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509492539] [2025-03-17 18:58:01,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:01,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 18:58:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 18:58:01,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:01,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:58:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:01,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509492539] [2025-03-17 18:58:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509492539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:01,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:01,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:58:01,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462299631] [2025-03-17 18:58:01,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:01,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:58:01,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:01,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:58:01,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:58:01,473 INFO L87 Difference]: Start difference. First operand 657 states and 921 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:58:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:01,622 INFO L93 Difference]: Finished difference Result 1311 states and 1870 transitions. [2025-03-17 18:58:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:58:01,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-03-17 18:58:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:01,626 INFO L225 Difference]: With dead ends: 1311 [2025-03-17 18:58:01,626 INFO L226 Difference]: Without dead ends: 752 [2025-03-17 18:58:01,627 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:58:01,628 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 119 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:01,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1560 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-17 18:58:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 699. [2025-03-17 18:58:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 607 states have (on average 1.472817133443163) internal successors, (894), 647 states have internal predecessors, (894), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 979 transitions. [2025-03-17 18:58:01,646 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 979 transitions. Word has length 59 [2025-03-17 18:58:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:01,647 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 979 transitions. [2025-03-17 18:58:01,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:58:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 979 transitions. [2025-03-17 18:58:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 18:58:01,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:01,647 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:01,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 18:58:01,647 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:01,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:01,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1037555248, now seen corresponding path program 1 times [2025-03-17 18:58:01,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:01,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053224148] [2025-03-17 18:58:01,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:01,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:01,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 18:58:01,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 18:58:01,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:01,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 18:58:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:01,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053224148] [2025-03-17 18:58:01,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053224148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:01,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:01,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:58:01,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486532125] [2025-03-17 18:58:01,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:01,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:58:01,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:01,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:58:01,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:58:01,911 INFO L87 Difference]: Start difference. First operand 699 states and 979 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:01,983 INFO L93 Difference]: Finished difference Result 701 states and 979 transitions. [2025-03-17 18:58:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:58:01,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-03-17 18:58:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:01,986 INFO L225 Difference]: With dead ends: 701 [2025-03-17 18:58:01,986 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 18:58:01,987 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:58:01,987 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 1 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:01,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1611 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 18:58:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-17 18:58:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 607 states have (on average 1.4695222405271828) internal successors, (892), 647 states have internal predecessors, (892), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 977 transitions. [2025-03-17 18:58:02,026 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 977 transitions. Word has length 61 [2025-03-17 18:58:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:02,026 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 977 transitions. [2025-03-17 18:58:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 977 transitions. [2025-03-17 18:58:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 18:58:02,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:02,027 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:02,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 18:58:02,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:02,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -2112301066, now seen corresponding path program 2 times [2025-03-17 18:58:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:02,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943090900] [2025-03-17 18:58:02,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:58:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:02,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-03-17 18:58:02,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 62 statements. [2025-03-17 18:58:02,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:58:02,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 18:58:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:02,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943090900] [2025-03-17 18:58:02,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943090900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:02,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:02,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 18:58:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024900335] [2025-03-17 18:58:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:02,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:58:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:02,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:58:02,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:58:02,406 INFO L87 Difference]: Start difference. First operand 699 states and 977 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 18:58:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:03,794 INFO L93 Difference]: Finished difference Result 1328 states and 1878 transitions. [2025-03-17 18:58:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:58:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 62 [2025-03-17 18:58:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:03,797 INFO L225 Difference]: With dead ends: 1328 [2025-03-17 18:58:03,797 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 18:58:03,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:58:03,798 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 522 mSDsluCounter, 2623 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:03,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 3412 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 18:58:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 18:58:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-17 18:58:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 607 states have (on average 1.4678747940691927) internal successors, (891), 647 states have internal predecessors, (891), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 976 transitions. [2025-03-17 18:58:03,813 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 976 transitions. Word has length 62 [2025-03-17 18:58:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 976 transitions. [2025-03-17 18:58:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 18:58:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 976 transitions. [2025-03-17 18:58:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 18:58:03,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:03,815 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:03,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 18:58:03,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:03,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1786105451, now seen corresponding path program 2 times [2025-03-17 18:58:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:03,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596467662] [2025-03-17 18:58:03,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:58:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:03,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 18:58:03,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-03-17 18:58:03,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:58:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 18:58:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596467662] [2025-03-17 18:58:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596467662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662446877] [2025-03-17 18:58:04,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:58:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:04,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:04,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 18:58:04,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-17 18:58:04,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 73 statements. [2025-03-17 18:58:04,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 18:58:04,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:04,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 18:58:04,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 18:58:04,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 18:58:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662446877] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:58:04,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:58:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 18:58:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371643326] [2025-03-17 18:58:04,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:58:04,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 18:58:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:04,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 18:58:04,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:58:04,764 INFO L87 Difference]: Start difference. First operand 699 states and 976 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:58:06,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 18:58:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:07,142 INFO L93 Difference]: Finished difference Result 699 states and 976 transitions. [2025-03-17 18:58:07,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 18:58:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 73 [2025-03-17 18:58:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:07,145 INFO L225 Difference]: With dead ends: 699 [2025-03-17 18:58:07,145 INFO L226 Difference]: Without dead ends: 698 [2025-03-17 18:58:07,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 18:58:07,145 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1015 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:07,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2691 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 18:58:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-17 18:58:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 683. [2025-03-17 18:58:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 592 states have (on average 1.4763513513513513) internal successors, (874), 631 states have internal predecessors, (874), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 959 transitions. [2025-03-17 18:58:07,158 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 959 transitions. Word has length 73 [2025-03-17 18:58:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 959 transitions. [2025-03-17 18:58:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:58:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 959 transitions. [2025-03-17 18:58:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 18:58:07,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:07,160 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:07,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 18:58:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:07,361 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1237057474, now seen corresponding path program 1 times [2025-03-17 18:58:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65362294] [2025-03-17 18:58:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 18:58:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 18:58:07,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:07,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 18:58:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65362294] [2025-03-17 18:58:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65362294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636000778] [2025-03-17 18:58:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:07,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:07,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 18:58:08,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 18:58:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 18:58:08,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:08,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:58:08,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 18:58:08,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-17 18:58:08,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636000778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:58:08,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:58:08,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 18:58:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41061302] [2025-03-17 18:58:08,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:58:08,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 18:58:08,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:08,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 18:58:08,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 18:58:08,592 INFO L87 Difference]: Start difference. First operand 683 states and 959 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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:58:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:09,237 INFO L93 Difference]: Finished difference Result 1346 states and 1902 transitions. [2025-03-17 18:58:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 18:58:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 78 [2025-03-17 18:58:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:09,240 INFO L225 Difference]: With dead ends: 1346 [2025-03-17 18:58:09,241 INFO L226 Difference]: Without dead ends: 701 [2025-03-17 18:58:09,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 18:58:09,244 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 4 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:09,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1609 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 18:58:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-03-17 18:58:09,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2025-03-17 18:58:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 610 states have (on average 1.4622950819672131) internal successors, (892), 649 states have internal predecessors, (892), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 977 transitions. [2025-03-17 18:58:09,262 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 977 transitions. Word has length 78 [2025-03-17 18:58:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 977 transitions. [2025-03-17 18:58:09,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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:58:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 977 transitions. [2025-03-17 18:58:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 18:58:09,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:09,263 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:09,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 18:58:09,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:09,463 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:09,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash 971044574, now seen corresponding path program 2 times [2025-03-17 18:58:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862245916] [2025-03-17 18:58:09,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:58:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:09,649 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 18:58:09,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 18:58:09,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 18:58:09,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862245916] [2025-03-17 18:58:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862245916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421563446] [2025-03-17 18:58:10,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 18:58:10,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:10,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:10,121 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:10,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 18:58:10,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 18:58:12,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 18:58:12,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 18:58:12,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:12,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 2365 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 18:58:12,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:12,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421563446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 18:58:12,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 18:58:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 18:58:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383285946] [2025-03-17 18:58:12,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 18:58:12,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 18:58:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:12,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 18:58:12,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 18:58:12,277 INFO L87 Difference]: Start difference. First operand 701 states and 977 transitions. Second operand has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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:58:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:12,978 INFO L93 Difference]: Finished difference Result 4026 states and 5853 transitions. [2025-03-17 18:58:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 18:58:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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 96 [2025-03-17 18:58:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:12,989 INFO L225 Difference]: With dead ends: 4026 [2025-03-17 18:58:12,989 INFO L226 Difference]: Without dead ends: 4025 [2025-03-17 18:58:12,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 18:58:12,991 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 7336 mSDsluCounter, 6066 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7416 SdHoareTripleChecker+Valid, 6867 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:12,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7416 Valid, 6867 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 18:58:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-03-17 18:58:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 725. [2025-03-17 18:58:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 634 states have (on average 1.4542586750788644) internal successors, (922), 673 states have internal predecessors, (922), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1007 transitions. [2025-03-17 18:58:13,027 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1007 transitions. Word has length 96 [2025-03-17 18:58:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:13,027 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1007 transitions. [2025-03-17 18:58:13,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.5) internal successors, (66), 13 states have internal predecessors, (66), 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:58:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1007 transitions. [2025-03-17 18:58:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 18:58:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:13,028 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:13,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 18:58:13,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-17 18:58:13,229 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1732108956, now seen corresponding path program 1 times [2025-03-17 18:58:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541714885] [2025-03-17 18:58:13,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 18:58:13,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 18:58:13,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:13,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541714885] [2025-03-17 18:58:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541714885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:58:13,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976947920] [2025-03-17 18:58:13,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:58:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:13,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:58:13,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:58:13,683 INFO L87 Difference]: Start difference. First operand 725 states and 1007 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:13,828 INFO L93 Difference]: Finished difference Result 778 states and 1086 transitions. [2025-03-17 18:58:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:58:13,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-17 18:58:13,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:13,835 INFO L225 Difference]: With dead ends: 778 [2025-03-17 18:58:13,835 INFO L226 Difference]: Without dead ends: 773 [2025-03-17 18:58:13,835 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:58:13,837 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 188 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:13,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1429 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:13,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-17 18:58:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 720. [2025-03-17 18:58:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 634 states have (on average 1.446372239747634) internal successors, (917), 668 states have internal predecessors, (917), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1002 transitions. [2025-03-17 18:58:13,887 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1002 transitions. Word has length 101 [2025-03-17 18:58:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:13,887 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1002 transitions. [2025-03-17 18:58:13,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1002 transitions. [2025-03-17 18:58:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 18:58:13,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:13,888 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:13,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 18:58:13,888 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:13,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2139198084, now seen corresponding path program 1 times [2025-03-17 18:58:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:13,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708999915] [2025-03-17 18:58:13,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:14,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 18:58:14,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 18:58:14,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:14,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708999915] [2025-03-17 18:58:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708999915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:58:14,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924257431] [2025-03-17 18:58:14,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:14,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:58:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:14,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:58:14,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:58:14,216 INFO L87 Difference]: Start difference. First operand 720 states and 1002 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:14,333 INFO L93 Difference]: Finished difference Result 773 states and 1081 transitions. [2025-03-17 18:58:14,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:58:14,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-17 18:58:14,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:14,335 INFO L225 Difference]: With dead ends: 773 [2025-03-17 18:58:14,335 INFO L226 Difference]: Without dead ends: 768 [2025-03-17 18:58:14,336 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:58:14,336 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 186 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:14,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1439 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-17 18:58:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 703. [2025-03-17 18:58:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 622 states have (on average 1.4389067524115755) internal successors, (895), 651 states have internal predecessors, (895), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 980 transitions. [2025-03-17 18:58:14,354 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 980 transitions. Word has length 102 [2025-03-17 18:58:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:14,354 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 980 transitions. [2025-03-17 18:58:14,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 980 transitions. [2025-03-17 18:58:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 18:58:14,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:14,356 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 18:58:14,356 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:14,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash -678674702, now seen corresponding path program 1 times [2025-03-17 18:58:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987838811] [2025-03-17 18:58:14,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 18:58:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 18:58:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987838811] [2025-03-17 18:58:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987838811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802363807] [2025-03-17 18:58:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:14,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:14,828 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 18:58:14,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 18:58:15,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 18:58:15,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 18:58:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:15,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 2453 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 18:58:15,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-17 18:58:15,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:58:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802363807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:58:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 18:58:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451889209] [2025-03-17 18:58:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:15,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 18:58:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:15,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 18:58:15,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:58:15,659 INFO L87 Difference]: Start difference. First operand 703 states and 980 transitions. Second operand has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:58:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:15,837 INFO L93 Difference]: Finished difference Result 1372 states and 1957 transitions. [2025-03-17 18:58:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 18:58:15,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2025-03-17 18:58:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:15,840 INFO L225 Difference]: With dead ends: 1372 [2025-03-17 18:58:15,841 INFO L226 Difference]: Without dead ends: 821 [2025-03-17 18:58:15,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 18:58:15,849 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 310 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:15,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2364 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:15,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-17 18:58:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 704. [2025-03-17 18:58:15,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 625 states have (on average 1.4336) internal successors, (896), 652 states have internal predecessors, (896), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 981 transitions. [2025-03-17 18:58:15,868 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 981 transitions. Word has length 104 [2025-03-17 18:58:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:15,869 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 981 transitions. [2025-03-17 18:58:15,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.5) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 18:58:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 981 transitions. [2025-03-17 18:58:15,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 18:58:15,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:15,871 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:15,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 18:58:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-17 18:58:16,072 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:16,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1985912643, now seen corresponding path program 1 times [2025-03-17 18:58:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163254823] [2025-03-17 18:58:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:16,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 18:58:16,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 18:58:16,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:16,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-03-17 18:58:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:16,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163254823] [2025-03-17 18:58:16,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163254823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:16,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 18:58:16,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 18:58:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60903099] [2025-03-17 18:58:16,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:16,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 18:58:16,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:16,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 18:58:16,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 18:58:16,417 INFO L87 Difference]: Start difference. First operand 704 states and 981 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:16,485 INFO L93 Difference]: Finished difference Result 704 states and 981 transitions. [2025-03-17 18:58:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 18:58:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-03-17 18:58:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:16,487 INFO L225 Difference]: With dead ends: 704 [2025-03-17 18:58:16,487 INFO L226 Difference]: Without dead ends: 703 [2025-03-17 18:58:16,488 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:58:16,488 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:16,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1585 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-17 18:58:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2025-03-17 18:58:16,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 625 states have (on average 1.432) internal successors, (895), 651 states have internal predecessors, (895), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-17 18:58:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 980 transitions. [2025-03-17 18:58:16,504 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 980 transitions. Word has length 107 [2025-03-17 18:58:16,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:16,505 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 980 transitions. [2025-03-17 18:58:16,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 980 transitions. [2025-03-17 18:58:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 18:58:16,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:16,506 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:16,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 18:58:16,506 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1433748722, now seen corresponding path program 1 times [2025-03-17 18:58:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312722412] [2025-03-17 18:58:16,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:16,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 18:58:16,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 18:58:16,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:16,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-17 18:58:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312722412] [2025-03-17 18:58:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312722412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29035302] [2025-03-17 18:58:21,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:21,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:21,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:21,266 INFO L229 MonitoredProcess]: Starting monitored process 14 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:58:21,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 18:58:21,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 18:58:22,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 18:58:22,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:22,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 2458 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 18:58:22,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-17 18:58:22,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 18:58:22,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29035302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 18:58:22,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 18:58:22,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2025-03-17 18:58:22,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362325773] [2025-03-17 18:58:22,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 18:58:22,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 18:58:22,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 18:58:22,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 18:58:22,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 18:58:22,103 INFO L87 Difference]: Start difference. First operand 703 states and 980 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 18:58:22,238 INFO L93 Difference]: Finished difference Result 1290 states and 1832 transitions. [2025-03-17 18:58:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 18:58:22,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-17 18:58:22,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 18:58:22,242 INFO L225 Difference]: With dead ends: 1290 [2025-03-17 18:58:22,242 INFO L226 Difference]: Without dead ends: 706 [2025-03-17 18:58:22,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-17 18:58:22,243 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 0 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 18:58:22,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2372 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 18:58:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-17 18:58:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2025-03-17 18:58:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 627 states have (on average 1.4322169059011165) internal successors, (898), 654 states have internal predecessors, (898), 46 states have call successors, (46), 15 states have call predecessors, (46), 14 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2025-03-17 18:58:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 986 transitions. [2025-03-17 18:58:22,261 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 986 transitions. Word has length 108 [2025-03-17 18:58:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 18:58:22,261 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 986 transitions. [2025-03-17 18:58:22,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 18:58:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 986 transitions. [2025-03-17 18:58:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 18:58:22,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 18:58:22,262 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 18:58:22,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 18:58:22,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 18:58:22,463 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 67 more)] === [2025-03-17 18:58:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 18:58:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1937653460, now seen corresponding path program 1 times [2025-03-17 18:58:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 18:58:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493104046] [2025-03-17 18:58:22,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 18:58:22,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 18:58:22,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 18:58:22,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-17 18:58:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 18:58:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493104046] [2025-03-17 18:58:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493104046] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 18:58:27,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542887888] [2025-03-17 18:58:27,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 18:58:27,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 18:58:27,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 18:58:27,066 INFO L229 MonitoredProcess]: Starting monitored process 15 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:58:27,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 18:58:27,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 18:58:27,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 18:58:27,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 18:58:27,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 18:58:27,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 2473 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-17 18:58:27,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 18:58:27,967 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 18:58:27,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 18:58:27,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:27,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2025-03-17 18:58:27,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,581 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 18:58:28,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 18:58:28,715 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-17 18:58:28,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-17 18:58:28,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:28,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2025-03-17 18:58:28,830 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:28,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 89 [2025-03-17 18:58:28,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-03-17 18:58:28,859 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-17 18:58:28,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 40 [2025-03-17 18:58:28,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-17 18:58:28,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2025-03-17 18:58:28,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 18:58:28,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2025-03-17 18:58:28,912 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:28,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:28,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:28,942 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:28,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:28,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:28,981 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:28,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:28,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,016 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,059 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,099 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,137 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,174 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,212 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 18:58:29,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-03-17 18:58:29,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-03-17 18:58:29,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-03-17 18:58:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 18:58:29,319 WARN L873 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.base| Int)) (= (store |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_int)| |#Ultimate.C_memset_#ptr.base|) |c_#Ultimate.C_memset_#ptr.offset| |c_#Ultimate.C_memset_#value|)) |c_#memory_int|)) is different from true [2025-03-17 18:58:29,341 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 18:58:29,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2025-03-17 18:58:29,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 18:58:29,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-03-17 18:58:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 1 not checked. [2025-03-17 18:58:29,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 18:58:30,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8400 (Array Int Int)) (v_ArrVal_8401 (Array Int Int)) (v_ArrVal_8398 (Array Int Int)) (v_ArrVal_8399 (Array Int Int)) (v_ArrVal_8393 (Array Int Int)) (v_ArrVal_8396 (Array Int Int)) (v_ArrVal_8397 (Array Int Int)) (v_ArrVal_8394 (Array Int Int)) (v_ArrVal_8395 (Array Int Int))) (not (= (select (select (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8394))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_8395))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_8397))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8393) .cse1 v_ArrVal_8396) .cse2 v_ArrVal_8398) .cse3 v_ArrVal_8399) (select (select (store .cse4 .cse3 v_ArrVal_8400) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_8401))))))))) 18) 0) 33))) is different from false [2025-03-17 18:58:30,080 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8400 (Array Int Int)) (v_ArrVal_8401 (Array Int Int)) (v_ArrVal_8398 (Array Int Int)) (v_ArrVal_8399 (Array Int Int)) (v_ArrVal_8392 (Array Int Int)) (v_ArrVal_8393 (Array Int Int)) (v_ArrVal_8391 (Array Int Int)) (v_ArrVal_8396 (Array Int Int)) (v_ArrVal_8397 (Array Int Int)) (v_ArrVal_8394 (Array Int Int)) (v_ArrVal_8395 (Array Int Int))) (not (= (select (select (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8392))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_8394))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_8395))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_8397))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8391) .cse1 v_ArrVal_8393) .cse2 v_ArrVal_8396) .cse3 v_ArrVal_8398) .cse4 v_ArrVal_8399) (select (select (store .cse5 .cse4 v_ArrVal_8400) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_8401))))))))))) 18) 0) 33))) is different from false [2025-03-17 18:58:30,118 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8392 (Array Int Int)) (v_ArrVal_8393 (Array Int Int)) (v_ArrVal_8390 (Array Int Int)) (v_ArrVal_8391 (Array Int Int)) (v_ArrVal_8396 (Array Int Int)) (v_ArrVal_8397 (Array Int Int)) (v_ArrVal_8394 (Array Int Int)) (v_ArrVal_8395 (Array Int Int)) (v_ArrVal_8389 (Array Int Int)) (v_ArrVal_8400 (Array Int Int)) (v_ArrVal_8401 (Array Int Int)) (v_ArrVal_8398 (Array Int Int)) (v_ArrVal_8399 (Array Int Int))) (not (= 33 (select (select (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8389))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_8392))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_8394))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_8395))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_8397))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8390) .cse1 v_ArrVal_8391) .cse2 v_ArrVal_8393) .cse3 v_ArrVal_8396) .cse4 v_ArrVal_8398) .cse5 v_ArrVal_8399) (select (select (store .cse6 .cse5 v_ArrVal_8400) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_8401))))))))))))) 18) 0)))) is different from false [2025-03-17 18:58:30,181 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8392 (Array Int Int)) (v_ArrVal_8393 (Array Int Int)) (v_ArrVal_8390 (Array Int Int)) (v_ArrVal_8391 (Array Int Int)) (v_ArrVal_8396 (Array Int Int)) (v_ArrVal_8397 (Array Int Int)) (v_ArrVal_8394 (Array Int Int)) (v_ArrVal_8395 (Array Int Int)) (v_ArrVal_8389 (Array Int Int)) (v_ArrVal_8400 (Array Int Int)) (v_ArrVal_8401 (Array Int Int)) (v_ArrVal_8387 (Array Int Int)) (v_ArrVal_8398 (Array Int Int)) (v_ArrVal_8388 (Array Int Int)) (v_ArrVal_8399 (Array Int Int))) (not (= (select (select (let ((.cse8 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8388))) (let ((.cse1 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse12 (store .cse13 .cse1 v_ArrVal_8389))) (let ((.cse2 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse11 (store .cse12 .cse2 v_ArrVal_8392))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse3 v_ArrVal_8394))) (let ((.cse4 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse4 v_ArrVal_8395))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (let ((.cse7 (store .cse9 .cse5 v_ArrVal_8397))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8))) (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_8387) .cse1 v_ArrVal_8390) .cse2 v_ArrVal_8391) .cse3 v_ArrVal_8393) .cse4 v_ArrVal_8396) .cse5 v_ArrVal_8398) .cse6 v_ArrVal_8399) (select (select (store .cse7 .cse6 v_ArrVal_8400) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse8) v_ArrVal_8401))))))))))))))) 18) 0) 33))) is different from false