./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59e9a970db574e887b8f20a3b70f02a1835d825d4580388273c8fd31c622f7ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:54:28,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:54:28,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:54:28,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:54:28,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:54:28,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:54:28,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:54:28,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:54:28,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:54:28,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:54:28,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:54:28,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:54:28,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:54:28,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:54:28,569 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:54:28,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:54:28,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:54:28,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:28,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:54:28,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:54:28,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:54:28,572 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 -> 59e9a970db574e887b8f20a3b70f02a1835d825d4580388273c8fd31c622f7ca [2025-03-09 05:54:28,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:54:28,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:54:28,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:54:28,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:54:28,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:54:28,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-1.i [2025-03-09 05:54:29,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb18ccbf6/a5ca9102ed854b139071e924085631c3/FLAGb7701577a [2025-03-09 05:54:30,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:54:30,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-1.i [2025-03-09 05:54:30,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb18ccbf6/a5ca9102ed854b139071e924085631c3/FLAGb7701577a [2025-03-09 05:54:30,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb18ccbf6/a5ca9102ed854b139071e924085631c3 [2025-03-09 05:54:30,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:54:30,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:54:30,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:30,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:54:30,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:54:30,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:30,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@855159e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:30, skipping insertion in model container [2025-03-09 05:54:30,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:54:30" (1/1) ... [2025-03-09 05:54:30,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:54:31,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:31,461 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:54:31,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:54:31,714 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-09 05:54:31,721 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:54:31,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31 WrapperNode [2025-03-09 05:54:31,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:54:31,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:31,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:54:31,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:54:31,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,840 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2798 [2025-03-09 05:54:31,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:54:31,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:54:31,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:54:31,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:54:31,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,867 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-09 05:54:31,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:54:31,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:54:31,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:54:31,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:54:31,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (1/1) ... [2025-03-09 05:54:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:54:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:32,017 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-09 05:54:32,020 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-09 05:54:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-03-09 05:54:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-03-09 05:54:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-03-09 05:54:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-03-09 05:54:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-03-09 05:54:32,038 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:54:32,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:54:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-09 05:54:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-03-09 05:54:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-03-09 05:54:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-03-09 05:54:32,039 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-03-09 05:54:32,039 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-03-09 05:54:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:54:32,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-09 05:54:32,040 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-03-09 05:54:32,041 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-03-09 05:54:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-09 05:54:32,041 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-03-09 05:54:32,042 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-03-09 05:54:32,042 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-03-09 05:54:32,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-03-09 05:54:32,042 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-03-09 05:54:32,042 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-03-09 05:54:32,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-09 05:54:32,042 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-03-09 05:54:32,042 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-03-09 05:54:32,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:54:32,415 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:54:32,502 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3564: havoc #t~nondet287; [2025-03-09 05:54:32,913 INFO L1307 $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-09 05:54:32,913 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3656: havoc lstat_#t~ret332#1; [2025-03-09 05:54:32,913 INFO L1307 $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-09 05:54:32,913 INFO L1307 $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-09 05:54:32,914 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3652: havoc stat_#t~ret331#1; [2025-03-09 05:54:34,452 INFO L1307 $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-09 05:54:34,453 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc getopt_long_#t~ret364#1; [2025-03-09 05:54:34,667 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-09 05:54:34,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:54:34,726 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:54:34,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:54:34,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:34 BoogieIcfgContainer [2025-03-09 05:54:34,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:54:34,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:54:34,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:54:34,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:54:34,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:54:30" (1/3) ... [2025-03-09 05:54:34,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcb7c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:34, skipping insertion in model container [2025-03-09 05:54:34,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:54:31" (2/3) ... [2025-03-09 05:54:34,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcb7c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:54:34, skipping insertion in model container [2025-03-09 05:54:34,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:54:34" (3/3) ... [2025-03-09 05:54:34,735 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-1.i [2025-03-09 05:54:34,747 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:54:34,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-1.i that has 16 procedures, 700 locations, 1 initial locations, 34 loop locations, and 62 error locations. [2025-03-09 05:54:34,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:54:34,847 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;@2e62be0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:54:34,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-09 05:54:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 700 states, 572 states have (on average 1.6136363636363635) internal successors, (923), 640 states have internal predecessors, (923), 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-09 05:54:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:54:34,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:34,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:54:34,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 36878207, now seen corresponding path program 1 times [2025-03-09 05:54:34,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:34,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867119246] [2025-03-09 05:54:34,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:34,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:35,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:54:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:54:35,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:35,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:35,551 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-09 05:54:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:35,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867119246] [2025-03-09 05:54:35,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867119246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:35,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:35,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299576969] [2025-03-09 05:54:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:35,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:35,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:35,574 INFO L87 Difference]: Start difference. First operand has 700 states, 572 states have (on average 1.6136363636363635) internal successors, (923), 640 states have internal predecessors, (923), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:35,782 INFO L93 Difference]: Finished difference Result 1306 states and 1956 transitions. [2025-03-09 05:54:35,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 05:54:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:35,792 INFO L225 Difference]: With dead ends: 1306 [2025-03-09 05:54:35,793 INFO L226 Difference]: Without dead ends: 607 [2025-03-09 05:54:35,798 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-09 05:54:35,799 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1651 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-09 05:54:35,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1651 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-09 05:54:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-09 05:54:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 506 states have (on average 1.5454545454545454) internal successors, (782), 556 states have internal predecessors, (782), 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-09 05:54:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 865 transitions. [2025-03-09 05:54:35,858 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 865 transitions. Word has length 4 [2025-03-09 05:54:35,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:35,859 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 865 transitions. [2025-03-09 05:54:35,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:35,859 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 865 transitions. [2025-03-09 05:54:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:54:35,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:35,860 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:54:35,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:54:35,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:35,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -871838837, now seen corresponding path program 1 times [2025-03-09 05:54:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837114231] [2025-03-09 05:54:35,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:36,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:36,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:36,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:36,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:36,228 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-09 05:54:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837114231] [2025-03-09 05:54:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837114231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316787877] [2025-03-09 05:54:36,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:36,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:36,232 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-09 05:54:36,234 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-09 05:54:36,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:54:36,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:54:36,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:36,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:36,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:36,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:36,758 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-09 05:54:36,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:36,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316787877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:36,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082656823] [2025-03-09 05:54:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:36,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:36,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:36,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:36,763 INFO L87 Difference]: Start difference. First operand 607 states and 865 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:36,864 INFO L93 Difference]: Finished difference Result 607 states and 865 transitions. [2025-03-09 05:54:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:36,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:54:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:36,869 INFO L225 Difference]: With dead ends: 607 [2025-03-09 05:54:36,870 INFO L226 Difference]: Without dead ends: 606 [2025-03-09 05:54:36,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:36,871 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 1 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:36,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1641 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-09 05:54:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2025-03-09 05:54:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 506 states have (on average 1.5434782608695652) internal successors, (781), 555 states have internal predecessors, (781), 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-09 05:54:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 864 transitions. [2025-03-09 05:54:36,908 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 864 transitions. Word has length 7 [2025-03-09 05:54:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:36,908 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 864 transitions. [2025-03-09 05:54:36,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 864 transitions. [2025-03-09 05:54:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:54:36,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:36,909 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:54:36,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:54:37,109 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-09 05:54:37,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:37,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1257199039, now seen corresponding path program 1 times [2025-03-09 05:54:37,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213500409] [2025-03-09 05:54:37,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:54:37,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:54:37,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,470 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-09 05:54:37,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213500409] [2025-03-09 05:54:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213500409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274752541] [2025-03-09 05:54:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:37,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:37,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:37,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:37,472 INFO L87 Difference]: Start difference. First operand 606 states and 864 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:37,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:37,569 INFO L93 Difference]: Finished difference Result 606 states and 864 transitions. [2025-03-09 05:54:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 05:54:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:37,572 INFO L225 Difference]: With dead ends: 606 [2025-03-09 05:54:37,572 INFO L226 Difference]: Without dead ends: 605 [2025-03-09 05:54:37,573 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-09 05:54:37,573 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1642 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-09 05:54:37,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1642 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-09 05:54:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2025-03-09 05:54:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 504 states have (on average 1.5436507936507937) 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-09 05:54:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 861 transitions. [2025-03-09 05:54:37,613 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 861 transitions. Word has length 8 [2025-03-09 05:54:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:37,613 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 861 transitions. [2025-03-09 05:54:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:54:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 861 transitions. [2025-03-09 05:54:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:54:37,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:37,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:37,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:54:37,614 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:37,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1973632719, now seen corresponding path program 1 times [2025-03-09 05:54:37,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:37,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619617327] [2025-03-09 05:54:37,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:37,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:37,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:37,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:37,969 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-09 05:54:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:37,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619617327] [2025-03-09 05:54:37,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619617327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77595914] [2025-03-09 05:54:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:37,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:37,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:37,972 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-09 05:54:37,974 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-09 05:54:38,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:54:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:54:38,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:38,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:54:38,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:38,490 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-09 05:54:38,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77595914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:54:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146348068] [2025-03-09 05:54:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:38,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:38,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:38,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:38,491 INFO L87 Difference]: Start difference. First operand 603 states and 861 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:38,569 INFO L93 Difference]: Finished difference Result 603 states and 861 transitions. [2025-03-09 05:54:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:38,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 05:54:38,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:38,572 INFO L225 Difference]: With dead ends: 603 [2025-03-09 05:54:38,573 INFO L226 Difference]: Without dead ends: 601 [2025-03-09 05:54:38,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:38,573 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 529 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:38,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1117 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-09 05:54:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-09 05:54:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 504 states have (on average 1.5396825396825398) 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-09 05:54:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 859 transitions. [2025-03-09 05:54:38,597 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 859 transitions. Word has length 12 [2025-03-09 05:54:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 859 transitions. [2025-03-09 05:54:38,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 859 transitions. [2025-03-09 05:54:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:54:38,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:38,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:38,609 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-09 05:54:38,802 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-09 05:54:38,802 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1053071019, now seen corresponding path program 1 times [2025-03-09 05:54:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719602759] [2025-03-09 05:54:38,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:38,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:38,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:38,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:38,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,092 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-09 05:54:39,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:39,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719602759] [2025-03-09 05:54:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719602759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043169898] [2025-03-09 05:54:39,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:39,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:39,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:39,095 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-09 05:54:39,096 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-09 05:54:39,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:54:39,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:54:39,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:39,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:39,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:39,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:39,530 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-09 05:54:39,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:39,555 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-09 05:54:39,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043169898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:39,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283709435] [2025-03-09 05:54:39,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:39,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:39,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:39,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:39,557 INFO L87 Difference]: Start difference. First operand 601 states and 859 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:54:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:39,693 INFO L93 Difference]: Finished difference Result 1205 states and 1723 transitions. [2025-03-09 05:54:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:54:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:39,697 INFO L225 Difference]: With dead ends: 1205 [2025-03-09 05:54:39,697 INFO L226 Difference]: Without dead ends: 610 [2025-03-09 05:54:39,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:39,698 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 4 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:39,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3274 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-09 05:54:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-03-09 05:54:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 513 states have (on average 1.530214424951267) internal successors, (785), 559 states have internal predecessors, (785), 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-09 05:54:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 868 transitions. [2025-03-09 05:54:39,713 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 868 transitions. Word has length 13 [2025-03-09 05:54:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:39,713 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 868 transitions. [2025-03-09 05:54:39,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:54:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 868 transitions. [2025-03-09 05:54:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:54:39,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:39,714 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:39,725 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-09 05:54:39,914 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-09 05:54:39,915 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2088806583, now seen corresponding path program 2 times [2025-03-09 05:54:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:39,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351183146] [2025-03-09 05:54:39,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:54:40,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:54:40,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:40,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,318 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-09 05:54:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351183146] [2025-03-09 05:54:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351183146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:54:40,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323104845] [2025-03-09 05:54:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:54:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:54:40,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:40,320 INFO L87 Difference]: Start difference. First operand 610 states and 868 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,477 INFO L93 Difference]: Finished difference Result 610 states and 868 transitions. [2025-03-09 05:54:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:54:40,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:54:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,480 INFO L225 Difference]: With dead ends: 610 [2025-03-09 05:54:40,481 INFO L226 Difference]: Without dead ends: 608 [2025-03-09 05:54:40,481 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-09 05:54:40,481 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 528 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2680 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:40,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2680 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-09 05:54:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2025-03-09 05:54:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 513 states have (on average 1.5263157894736843) internal successors, (783), 557 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-09 05:54:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 866 transitions. [2025-03-09 05:54:40,497 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 866 transitions. Word has length 22 [2025-03-09 05:54:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 866 transitions. [2025-03-09 05:54:40,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 866 transitions. [2025-03-09 05:54:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:54:40,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,498 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-09 05:54:40,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:54:40,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 100598936, now seen corresponding path program 1 times [2025-03-09 05:54:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388866059] [2025-03-09 05:54:40,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:40,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:54:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:54:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:40,797 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-09 05:54:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388866059] [2025-03-09 05:54:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388866059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:40,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:54:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538116103] [2025-03-09 05:54:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:40,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:40,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:40,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:40,799 INFO L87 Difference]: Start difference. First operand 608 states and 866 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:40,883 INFO L93 Difference]: Finished difference Result 1199 states and 1716 transitions. [2025-03-09 05:54:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:40,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:54:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:40,886 INFO L225 Difference]: With dead ends: 1199 [2025-03-09 05:54:40,886 INFO L226 Difference]: Without dead ends: 611 [2025-03-09 05:54:40,888 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-09 05:54:40,888 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 2 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1631 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-09 05:54:40,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1631 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-09 05:54:40,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-03-09 05:54:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 516 states have (on average 1.5232558139534884) internal successors, (786), 560 states have internal predecessors, (786), 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-09 05:54:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2025-03-09 05:54:40,908 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 27 [2025-03-09 05:54:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:40,908 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2025-03-09 05:54:40,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2025-03-09 05:54:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 05:54:40,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:40,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:40,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:54:40,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:40,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1176733821, now seen corresponding path program 1 times [2025-03-09 05:54:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336073803] [2025-03-09 05:54:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:41,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 05:54:41,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 05:54:41,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,221 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-09 05:54:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336073803] [2025-03-09 05:54:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336073803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:41,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:41,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661726135] [2025-03-09 05:54:41,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:41,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:41,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:41,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:41,223 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:41,344 INFO L93 Difference]: Finished difference Result 909 states and 1308 transitions. [2025-03-09 05:54:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-09 05:54:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:41,348 INFO L225 Difference]: With dead ends: 909 [2025-03-09 05:54:41,348 INFO L226 Difference]: Without dead ends: 907 [2025-03-09 05:54:41,349 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-09 05:54:41,349 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 411 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1618 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-09 05:54:41,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1618 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:41,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-09 05:54:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 615. [2025-03-09 05:54:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 520 states have (on average 1.521153846153846) internal successors, (791), 564 states have internal predecessors, (791), 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-09 05:54:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 874 transitions. [2025-03-09 05:54:41,368 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 874 transitions. Word has length 28 [2025-03-09 05:54:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:41,368 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 874 transitions. [2025-03-09 05:54:41,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 874 transitions. [2025-03-09 05:54:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:41,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:41,369 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:41,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:54:41,369 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash -938395518, now seen corresponding path program 1 times [2025-03-09 05:54:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718920817] [2025-03-09 05:54:41,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:41,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:41,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:41,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:41,624 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-09 05:54:41,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:41,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718920817] [2025-03-09 05:54:41,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718920817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:41,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:41,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886730103] [2025-03-09 05:54:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:41,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:41,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:41,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:41,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:41,626 INFO L87 Difference]: Start difference. First operand 615 states and 874 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-09 05:54:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:41,740 INFO L93 Difference]: Finished difference Result 628 states and 889 transitions. [2025-03-09 05:54:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:41,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:54:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:41,743 INFO L225 Difference]: With dead ends: 628 [2025-03-09 05:54:41,744 INFO L226 Difference]: Without dead ends: 626 [2025-03-09 05:54:41,744 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-09 05:54:41,744 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 3 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:41,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1628 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:41,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-03-09 05:54:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2025-03-09 05:54:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 529 states have (on average 1.5198487712665407) internal successors, (804), 573 states have internal predecessors, (804), 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-09 05:54:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 887 transitions. [2025-03-09 05:54:41,764 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 887 transitions. Word has length 30 [2025-03-09 05:54:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:41,764 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 887 transitions. [2025-03-09 05:54:41,765 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-09 05:54:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 887 transitions. [2025-03-09 05:54:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:54:41,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:41,765 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:41,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:54:41,766 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:41,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -938395358, now seen corresponding path program 1 times [2025-03-09 05:54:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144379738] [2025-03-09 05:54:41,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:41,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:41,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:41,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:41,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,022 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-09 05:54:42,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144379738] [2025-03-09 05:54:42,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144379738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:42,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74614328] [2025-03-09 05:54:42,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:42,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:42,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:42,025 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-09 05:54:42,027 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-09 05:54:42,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:54:42,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:54:42,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:42,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:42,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:42,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:42,584 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-09 05:54:42,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:42,657 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-09 05:54:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74614328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:42,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293037669] [2025-03-09 05:54:42,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:42,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:42,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:42,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:42,659 INFO L87 Difference]: Start difference. First operand 624 states and 887 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:54:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:42,900 INFO L93 Difference]: Finished difference Result 1250 states and 1782 transitions. [2025-03-09 05:54:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:54:42,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 05:54:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:42,903 INFO L225 Difference]: With dead ends: 1250 [2025-03-09 05:54:42,903 INFO L226 Difference]: Without dead ends: 641 [2025-03-09 05:54:42,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:42,905 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 5 mSDsluCounter, 4860 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5672 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:42,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5672 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:42,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-03-09 05:54:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2025-03-09 05:54:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 547 states have (on average 1.4990859232175502) internal successors, (820), 590 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-09 05:54:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 903 transitions. [2025-03-09 05:54:42,920 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 903 transitions. Word has length 30 [2025-03-09 05:54:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:42,920 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 903 transitions. [2025-03-09 05:54:42,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:54:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 903 transitions. [2025-03-09 05:54:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:54:42,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:42,921 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-09 05:54:42,932 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-09 05:54:43,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:43,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:43,123 INFO L85 PathProgramCache]: Analyzing trace with hash -882327046, now seen corresponding path program 1 times [2025-03-09 05:54:43,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313609148] [2025-03-09 05:54:43,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:54:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:54:43,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,351 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-09 05:54:43,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313609148] [2025-03-09 05:54:43,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313609148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:43,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:43,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616178823] [2025-03-09 05:54:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:43,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:43,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:43,353 INFO L87 Difference]: Start difference. First operand 641 states and 903 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:43,423 INFO L93 Difference]: Finished difference Result 641 states and 903 transitions. [2025-03-09 05:54:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:54:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:43,426 INFO L225 Difference]: With dead ends: 641 [2025-03-09 05:54:43,426 INFO L226 Difference]: Without dead ends: 640 [2025-03-09 05:54:43,426 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-09 05:54:43,427 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 0 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1629 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:43,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1629 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-09 05:54:43,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2025-03-09 05:54:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 543 states have (on average 1.4990791896869244) internal successors, (814), 585 states have internal predecessors, (814), 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-09 05:54:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 897 transitions. [2025-03-09 05:54:43,442 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 897 transitions. Word has length 49 [2025-03-09 05:54:43,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:43,442 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 897 transitions. [2025-03-09 05:54:43,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:43,442 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 897 transitions. [2025-03-09 05:54:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 05:54:43,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:43,443 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, 1] [2025-03-09 05:54:43,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:54:43,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:43,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:43,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1693698553, now seen corresponding path program 1 times [2025-03-09 05:54:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:43,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753669413] [2025-03-09 05:54:43,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:43,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:43,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:43,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:43,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:43,713 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-09 05:54:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753669413] [2025-03-09 05:54:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753669413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728179719] [2025-03-09 05:54:43,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:43,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:43,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:43,716 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-09 05:54:43,718 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-09 05:54:44,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 05:54:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 05:54:44,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:44,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:44,278 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-09 05:54:44,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:54:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728179719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:54:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:54:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641063961] [2025-03-09 05:54:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:44,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:54:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:44,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:54:44,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:54:44,280 INFO L87 Difference]: Start difference. First operand 636 states and 897 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:44,421 INFO L93 Difference]: Finished difference Result 932 states and 1335 transitions. [2025-03-09 05:54:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:54:44,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-03-09 05:54:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:44,425 INFO L225 Difference]: With dead ends: 932 [2025-03-09 05:54:44,425 INFO L226 Difference]: Without dead ends: 931 [2025-03-09 05:54:44,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-09 05:54:44,426 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 821 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 2028 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-09 05:54:44,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 2028 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2025-03-09 05:54:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 635. [2025-03-09 05:54:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 543 states have (on average 1.4972375690607735) internal successors, (813), 584 states have internal predecessors, (813), 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-09 05:54:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 896 transitions. [2025-03-09 05:54:44,447 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 896 transitions. Word has length 50 [2025-03-09 05:54:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:44,447 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 896 transitions. [2025-03-09 05:54:44,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 896 transitions. [2025-03-09 05:54:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:54:44,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:44,448 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, 1] [2025-03-09 05:54:44,458 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-09 05:54:44,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 05:54:44,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:44,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash -965046489, now seen corresponding path program 1 times [2025-03-09 05:54:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:44,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128450064] [2025-03-09 05:54:44,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:44,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:54:44,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:54:44,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:44,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:44,909 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-09 05:54:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128450064] [2025-03-09 05:54:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128450064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937684552] [2025-03-09 05:54:44,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:44,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:44,911 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-09 05:54:44,913 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-09 05:54:45,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:54:45,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:54:45,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:45,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:45,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:45,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:45,453 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-09 05:54:45,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:45,477 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-09 05:54:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937684552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:45,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:54:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549364227] [2025-03-09 05:54:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:45,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:45,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:45,479 INFO L87 Difference]: Start difference. First operand 635 states and 896 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:54:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:45,725 INFO L93 Difference]: Finished difference Result 1816 states and 2642 transitions. [2025-03-09 05:54:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:45,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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 51 [2025-03-09 05:54:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:45,733 INFO L225 Difference]: With dead ends: 1816 [2025-03-09 05:54:45,733 INFO L226 Difference]: Without dead ends: 1815 [2025-03-09 05:54:45,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 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-09 05:54:45,736 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 2810 mSDsluCounter, 2481 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:45,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 3291 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-03-09 05:54:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 647. [2025-03-09 05:54:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 555 states have (on average 1.491891891891892) internal successors, (828), 596 states have internal predecessors, (828), 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-09 05:54:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 911 transitions. [2025-03-09 05:54:45,760 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 911 transitions. Word has length 51 [2025-03-09 05:54:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 911 transitions. [2025-03-09 05:54:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 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-09 05:54:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 911 transitions. [2025-03-09 05:54:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:54:45,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:45,762 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:45,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 05:54:45,962 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-09 05:54:45,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:45,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:45,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1672794352, now seen corresponding path program 1 times [2025-03-09 05:54:45,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:45,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115304180] [2025-03-09 05:54:45,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:46,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:46,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:46,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:46,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115304180] [2025-03-09 05:54:46,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115304180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:46,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124334321] [2025-03-09 05:54:46,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:46,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:46,193 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-09 05:54:46,194 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-09 05:54:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:54:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:54:46,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:46,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:54:46,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:46,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:54:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124334321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:46,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:54:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381900642] [2025-03-09 05:54:46,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:54:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:46,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:54:46,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:54:46,758 INFO L87 Difference]: Start difference. First operand 647 states and 911 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:46,851 INFO L93 Difference]: Finished difference Result 1269 states and 1799 transitions. [2025-03-09 05:54:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:46,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 05:54:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:46,855 INFO L225 Difference]: With dead ends: 1269 [2025-03-09 05:54:46,855 INFO L226 Difference]: Without dead ends: 665 [2025-03-09 05:54:46,856 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-09 05:54:46,856 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 4 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:46,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2439 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-09 05:54:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-09 05:54:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 573 states have (on average 1.4764397905759161) internal successors, (846), 614 states have internal predecessors, (846), 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-09 05:54:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 929 transitions. [2025-03-09 05:54:46,870 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 929 transitions. Word has length 55 [2025-03-09 05:54:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:46,870 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 929 transitions. [2025-03-09 05:54:46,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:54:46,870 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 929 transitions. [2025-03-09 05:54:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-09 05:54:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:46,871 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] [2025-03-09 05:54:46,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:54:47,071 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-09 05:54:47,072 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 471849835, now seen corresponding path program 1 times [2025-03-09 05:54:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600319592] [2025-03-09 05:54:47,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-09 05:54:47,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-09 05:54:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:47,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:47,335 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-09 05:54:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600319592] [2025-03-09 05:54:47,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600319592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:47,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:47,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:47,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545758367] [2025-03-09 05:54:47,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:47,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:47,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:47,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:47,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:47,337 INFO L87 Difference]: Start difference. First operand 665 states and 929 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-09 05:54:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:47,464 INFO L93 Difference]: Finished difference Result 1325 states and 1884 transitions. [2025-03-09 05:54:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:47,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 60 [2025-03-09 05:54:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:47,467 INFO L225 Difference]: With dead ends: 1325 [2025-03-09 05:54:47,468 INFO L226 Difference]: Without dead ends: 760 [2025-03-09 05:54:47,469 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-09 05:54:47,470 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 119 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1554 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-09 05:54:47,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1554 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-09 05:54:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 707. [2025-03-09 05:54:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4690553745928339) internal successors, (902), 655 states have internal predecessors, (902), 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-09 05:54:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 987 transitions. [2025-03-09 05:54:47,486 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 987 transitions. Word has length 60 [2025-03-09 05:54:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:47,487 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 987 transitions. [2025-03-09 05:54:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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-09 05:54:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 987 transitions. [2025-03-09 05:54:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-09 05:54:47,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:47,487 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, 1] [2025-03-09 05:54:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 05:54:47,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1818807447, now seen corresponding path program 1 times [2025-03-09 05:54:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:47,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201884196] [2025-03-09 05:54:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:47,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-09 05:54:47,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-09 05:54:47,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:47,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:47,709 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-09 05:54:47,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:47,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201884196] [2025-03-09 05:54:47,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201884196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:47,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:47,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:47,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522237146] [2025-03-09 05:54:47,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:47,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:47,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:47,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:47,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:47,711 INFO L87 Difference]: Start difference. First operand 707 states and 987 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-09 05:54:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:47,778 INFO L93 Difference]: Finished difference Result 709 states and 987 transitions. [2025-03-09 05:54:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:47,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 62 [2025-03-09 05:54:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:47,781 INFO L225 Difference]: With dead ends: 709 [2025-03-09 05:54:47,781 INFO L226 Difference]: Without dead ends: 707 [2025-03-09 05:54:47,781 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-09 05:54:47,782 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 1 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1627 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-09 05:54:47,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1627 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-09 05:54:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-09 05:54:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4657980456026058) internal successors, (900), 655 states have internal predecessors, (900), 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-09 05:54:47,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 985 transitions. [2025-03-09 05:54:47,800 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 985 transitions. Word has length 62 [2025-03-09 05:54:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:47,801 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 985 transitions. [2025-03-09 05:54:47,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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-09 05:54:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 985 transitions. [2025-03-09 05:54:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:54:47,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:47,801 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, 1] [2025-03-09 05:54:47,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:54:47,801 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1915074971, now seen corresponding path program 2 times [2025-03-09 05:54:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681628701] [2025-03-09 05:54:47,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:47,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:54:47,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-03-09 05:54:47,959 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:54:47,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:48,176 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-09 05:54:48,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:48,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681628701] [2025-03-09 05:54:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681628701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:48,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:48,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:54:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077007972] [2025-03-09 05:54:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:48,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:54:48,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:48,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:54:48,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:54:48,178 INFO L87 Difference]: Start difference. First operand 707 states and 985 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-09 05:54:48,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:48,400 INFO L93 Difference]: Finished difference Result 1342 states and 1892 transitions. [2025-03-09 05:54:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:54:48,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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 63 [2025-03-09 05:54:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:48,403 INFO L225 Difference]: With dead ends: 1342 [2025-03-09 05:54:48,403 INFO L226 Difference]: Without dead ends: 707 [2025-03-09 05:54:48,404 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-09 05:54:48,405 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 529 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:48,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 3444 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-03-09 05:54:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2025-03-09 05:54:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 614 states have (on average 1.4641693811074918) internal successors, (899), 655 states have internal predecessors, (899), 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-09 05:54:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 984 transitions. [2025-03-09 05:54:48,427 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 984 transitions. Word has length 63 [2025-03-09 05:54:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:48,427 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 984 transitions. [2025-03-09 05:54:48,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-09 05:54:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 984 transitions. [2025-03-09 05:54:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 05:54:48,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:48,428 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:54:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 05:54:48,428 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:48,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 918831584, now seen corresponding path program 2 times [2025-03-09 05:54:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899469759] [2025-03-09 05:54:48,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:48,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:54:48,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:54:48,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:54:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-03-09 05:54:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899469759] [2025-03-09 05:54:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899469759] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099570401] [2025-03-09 05:54:48,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:54:48,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:48,824 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-09 05:54:48,825 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-09 05:54:49,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-03-09 05:54:54,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 05:54:54,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:54:54,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:54,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:54:54,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-09 05:54:54,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099570401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:54,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:54,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:54:54,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646042834] [2025-03-09 05:54:54,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:54,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:54:54,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:54,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:54:54,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:54:54,541 INFO L87 Difference]: Start difference. First operand 707 states and 984 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:54:54,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:54,883 INFO L93 Difference]: Finished difference Result 1397 states and 1961 transitions. [2025-03-09 05:54:54,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 05:54:54,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:54:54,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:54,887 INFO L225 Difference]: With dead ends: 1397 [2025-03-09 05:54:54,887 INFO L226 Difference]: Without dead ends: 742 [2025-03-09 05:54:54,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 05:54:54,888 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 9 mSDsluCounter, 2421 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:54,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3231 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:54:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-09 05:54:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2025-03-09 05:54:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 650 states have (on average 1.436923076923077) internal successors, (934), 690 states have internal predecessors, (934), 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-09 05:54:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1019 transitions. [2025-03-09 05:54:54,906 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1019 transitions. Word has length 73 [2025-03-09 05:54:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:54,906 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1019 transitions. [2025-03-09 05:54:54,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 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-09 05:54:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1019 transitions. [2025-03-09 05:54:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-09 05:54:54,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:54,909 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, 1] [2025-03-09 05:54:54,926 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-09 05:54:55,113 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,SelfDestructingSolverStorable17 [2025-03-09 05:54:55,113 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:55,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:55,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2014805539, now seen corresponding path program 1 times [2025-03-09 05:54:55,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:55,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459500340] [2025-03-09 05:54:55,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:55,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:55,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:54:55,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:54:55,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:55,480 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-09 05:54:55,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459500340] [2025-03-09 05:54:55,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459500340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:55,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412835537] [2025-03-09 05:54:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:55,482 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-09 05:54:55,484 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-09 05:54:55,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-09 05:54:56,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-09 05:54:56,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:56,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:56,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:54:56,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:54:56,140 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-09 05:54:56,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:54:56,199 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-09 05:54:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412835537] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:54:56,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:54:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 05:54:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329952154] [2025-03-09 05:54:56,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:54:56,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:54:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:54:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:54:56,200 INFO L87 Difference]: Start difference. First operand 742 states and 1019 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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-09 05:54:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:56,911 INFO L93 Difference]: Finished difference Result 4107 states and 5935 transitions. [2025-03-09 05:54:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:54:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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 97 [2025-03-09 05:54:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:56,925 INFO L225 Difference]: With dead ends: 4107 [2025-03-09 05:54:56,925 INFO L226 Difference]: Without dead ends: 4106 [2025-03-09 05:54:56,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:54:56,928 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 4977 mSDsluCounter, 9609 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 10418 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:56,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 10418 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:54:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2025-03-09 05:54:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 766. [2025-03-09 05:54:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 674 states have (on average 1.4302670623145401) internal successors, (964), 714 states have internal predecessors, (964), 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-09 05:54:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1049 transitions. [2025-03-09 05:54:56,967 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1049 transitions. Word has length 97 [2025-03-09 05:54:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:56,968 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1049 transitions. [2025-03-09 05:54:56,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 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-09 05:54:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1049 transitions. [2025-03-09 05:54:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:54:56,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:56,969 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-09 05:54:56,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 05:54:57,173 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-09 05:54:57,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1640078566, now seen corresponding path program 1 times [2025-03-09 05:54:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295254384] [2025-03-09 05:54:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:57,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:54:57,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:54:57,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:57,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:57,526 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-09 05:54:57,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295254384] [2025-03-09 05:54:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295254384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:57,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:57,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126444159] [2025-03-09 05:54:57,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:57,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:57,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:57,528 INFO L87 Difference]: Start difference. First operand 766 states and 1049 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-09 05:54:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:57,664 INFO L93 Difference]: Finished difference Result 1327 states and 1875 transitions. [2025-03-09 05:54:57,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:57,665 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-09 05:54:57,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:57,668 INFO L225 Difference]: With dead ends: 1327 [2025-03-09 05:54:57,668 INFO L226 Difference]: Without dead ends: 818 [2025-03-09 05:54:57,669 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-09 05:54:57,671 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 74 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:57,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1630 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-03-09 05:54:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 769. [2025-03-09 05:54:57,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 679 states have (on average 1.4256259204712813) internal successors, (968), 717 states have internal predecessors, (968), 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-09 05:54:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1053 transitions. [2025-03-09 05:54:57,694 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1053 transitions. Word has length 102 [2025-03-09 05:54:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:57,694 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1053 transitions. [2025-03-09 05:54:57,694 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-09 05:54:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1053 transitions. [2025-03-09 05:54:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 05:54:57,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:57,695 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-09 05:54:57,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 05:54:57,695 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1635801891, now seen corresponding path program 1 times [2025-03-09 05:54:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624425267] [2025-03-09 05:54:57,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:57,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 05:54:57,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 05:54:57,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:57,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:58,000 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-09 05:54:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624425267] [2025-03-09 05:54:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624425267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:58,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:58,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:58,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321365380] [2025-03-09 05:54:58,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:58,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:58,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:58,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:58,002 INFO L87 Difference]: Start difference. First operand 769 states and 1053 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-09 05:54:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:58,114 INFO L93 Difference]: Finished difference Result 822 states and 1132 transitions. [2025-03-09 05:54:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:58,114 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-09 05:54:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:58,117 INFO L225 Difference]: With dead ends: 822 [2025-03-09 05:54:58,118 INFO L226 Difference]: Without dead ends: 819 [2025-03-09 05:54:58,118 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-09 05:54:58,118 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 188 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:58,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1445 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-09 05:54:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 766. [2025-03-09 05:54:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 679 states have (on average 1.4212076583210604) internal successors, (965), 714 states have internal predecessors, (965), 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-09 05:54:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1050 transitions. [2025-03-09 05:54:58,164 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1050 transitions. Word has length 102 [2025-03-09 05:54:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1050 transitions. [2025-03-09 05:54:58,164 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-09 05:54:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1050 transitions. [2025-03-09 05:54:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:54:58,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:58,165 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, 1] [2025-03-09 05:54:58,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:54:58,166 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:58,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:58,166 INFO L85 PathProgramCache]: Analyzing trace with hash 697172846, now seen corresponding path program 1 times [2025-03-09 05:54:58,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:58,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219420306] [2025-03-09 05:54:58,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:58,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:58,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:54:58,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:54:58,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:58,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:58,455 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-09 05:54:58,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:58,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219420306] [2025-03-09 05:54:58,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219420306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:58,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:58,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:58,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359506297] [2025-03-09 05:54:58,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:58,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:58,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:58,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:58,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:58,457 INFO L87 Difference]: Start difference. First operand 766 states and 1050 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-09 05:54:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:58,606 INFO L93 Difference]: Finished difference Result 1329 states and 1877 transitions. [2025-03-09 05:54:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:58,608 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 103 [2025-03-09 05:54:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:58,611 INFO L225 Difference]: With dead ends: 1329 [2025-03-09 05:54:58,611 INFO L226 Difference]: Without dead ends: 816 [2025-03-09 05:54:58,613 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-09 05:54:58,614 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 156 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:58,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1521 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-09 05:54:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 751. [2025-03-09 05:54:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 668 states have (on average 1.4146706586826348) internal successors, (945), 699 states have internal predecessors, (945), 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-09 05:54:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1030 transitions. [2025-03-09 05:54:58,646 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1030 transitions. Word has length 103 [2025-03-09 05:54:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:58,646 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1030 transitions. [2025-03-09 05:54:58,646 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-09 05:54:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1030 transitions. [2025-03-09 05:54:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 05:54:58,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:58,648 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, 1] [2025-03-09 05:54:58,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 05:54:58,648 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:58,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:58,648 INFO L85 PathProgramCache]: Analyzing trace with hash 829749810, now seen corresponding path program 1 times [2025-03-09 05:54:58,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:58,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204890974] [2025-03-09 05:54:58,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:58,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:58,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 05:54:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 05:54:58,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:58,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:58,946 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-09 05:54:58,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:58,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204890974] [2025-03-09 05:54:58,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204890974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:54:58,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:54:58,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:54:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949321477] [2025-03-09 05:54:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:54:58,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:54:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:54:58,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:54:58,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:54:58,948 INFO L87 Difference]: Start difference. First operand 751 states and 1030 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-09 05:54:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:54:59,054 INFO L93 Difference]: Finished difference Result 804 states and 1109 transitions. [2025-03-09 05:54:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:54:59,055 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 103 [2025-03-09 05:54:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:54:59,057 INFO L225 Difference]: With dead ends: 804 [2025-03-09 05:54:59,057 INFO L226 Difference]: Without dead ends: 803 [2025-03-09 05:54:59,058 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-09 05:54:59,058 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 186 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:54:59,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1455 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:54:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-09 05:54:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 750. [2025-03-09 05:54:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 668 states have (on average 1.4131736526946108) internal successors, (944), 698 states have internal predecessors, (944), 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-09 05:54:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1029 transitions. [2025-03-09 05:54:59,077 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1029 transitions. Word has length 103 [2025-03-09 05:54:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:54:59,077 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1029 transitions. [2025-03-09 05:54:59,078 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-09 05:54:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1029 transitions. [2025-03-09 05:54:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 05:54:59,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:54:59,081 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, 1] [2025-03-09 05:54:59,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:54:59,082 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:54:59,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:54:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash -633048064, now seen corresponding path program 1 times [2025-03-09 05:54:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:54:59,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171043218] [2025-03-09 05:54:59,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:59,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:54:59,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:54:59,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:54:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:54:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:54:59,380 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-09 05:54:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:54:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171043218] [2025-03-09 05:54:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171043218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:54:59,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158550994] [2025-03-09 05:54:59,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:54:59,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:54:59,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:54:59,383 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-09 05:54:59,384 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-09 05:54:59,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 05:55:00,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 05:55:00,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:00,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:00,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:55:00,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:00,091 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-09 05:55:00,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158550994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:00,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-09 05:55:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367813583] [2025-03-09 05:55:00,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:00,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:55:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:00,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:55:00,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:55:00,092 INFO L87 Difference]: Start difference. First operand 750 states and 1029 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-09 05:55:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:00,250 INFO L93 Difference]: Finished difference Result 1428 states and 2013 transitions. [2025-03-09 05:55:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:55:00,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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 105 [2025-03-09 05:55:00,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:00,254 INFO L225 Difference]: With dead ends: 1428 [2025-03-09 05:55:00,254 INFO L226 Difference]: Without dead ends: 865 [2025-03-09 05:55:00,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 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-09 05:55:00,255 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 326 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:00,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1945 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-09 05:55:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 749. [2025-03-09 05:55:00,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 669 states have (on average 1.406576980568012) internal successors, (941), 697 states have internal predecessors, (941), 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-09 05:55:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1026 transitions. [2025-03-09 05:55:00,273 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1026 transitions. Word has length 105 [2025-03-09 05:55:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:00,273 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1026 transitions. [2025-03-09 05:55:00,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 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-09 05:55:00,273 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1026 transitions. [2025-03-09 05:55:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:55:00,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:00,274 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, 1] [2025-03-09 05:55:00,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 05:55:00,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 05:55:00,475 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:00,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:00,475 INFO L85 PathProgramCache]: Analyzing trace with hash 67601461, now seen corresponding path program 1 times [2025-03-09 05:55:00,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:00,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498251471] [2025-03-09 05:55:00,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:55:00,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:55:00,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:00,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:00,726 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-09 05:55:00,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:00,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498251471] [2025-03-09 05:55:00,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498251471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:00,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:55:00,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:55:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342565777] [2025-03-09 05:55:00,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:00,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:55:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:00,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:55:00,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:55:00,728 INFO L87 Difference]: Start difference. First operand 749 states and 1026 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-09 05:55:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:00,784 INFO L93 Difference]: Finished difference Result 749 states and 1026 transitions. [2025-03-09 05:55:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:55:00,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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 108 [2025-03-09 05:55:00,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:00,786 INFO L225 Difference]: With dead ends: 749 [2025-03-09 05:55:00,786 INFO L226 Difference]: Without dead ends: 748 [2025-03-09 05:55:00,787 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-09 05:55:00,787 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 1 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1601 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:00,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1601 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:55:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-09 05:55:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2025-03-09 05:55:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 669 states have (on average 1.4050822122571) internal successors, (940), 696 states have internal predecessors, (940), 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-09 05:55:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1025 transitions. [2025-03-09 05:55:00,816 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1025 transitions. Word has length 108 [2025-03-09 05:55:00,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:00,816 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1025 transitions. [2025-03-09 05:55:00,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-09 05:55:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1025 transitions. [2025-03-09 05:55:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 05:55:00,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:00,818 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-09 05:55:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 05:55:00,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:00,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:00,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2095646365, now seen corresponding path program 1 times [2025-03-09 05:55:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462505102] [2025-03-09 05:55:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:00,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:55:01,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:55:01,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:05,527 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-09 05:55:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462505102] [2025-03-09 05:55:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462505102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898287854] [2025-03-09 05:55:05,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:05,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:05,530 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-09 05:55:05,532 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-09 05:55:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-09 05:55:06,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:55:06,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:06,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 2459 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:55:06,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:06,311 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-09 05:55:06,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:55:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898287854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:55:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:55:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2025-03-09 05:55:06,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736212239] [2025-03-09 05:55:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:55:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:55:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:06,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:55:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-09 05:55:06,312 INFO L87 Difference]: Start difference. First operand 748 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-09 05:55:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:06,404 INFO L93 Difference]: Finished difference Result 1345 states and 1886 transitions. [2025-03-09 05:55:06,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:55:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 109 [2025-03-09 05:55:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:06,408 INFO L225 Difference]: With dead ends: 1345 [2025-03-09 05:55:06,408 INFO L226 Difference]: Without dead ends: 751 [2025-03-09 05:55:06,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-09 05:55:06,410 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 0 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2396 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-09 05:55:06,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2396 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-09 05:55:06,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2025-03-09 05:55:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 671 states have (on average 1.405365126676602) internal successors, (943), 699 states have internal predecessors, (943), 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-09 05:55:06,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1031 transitions. [2025-03-09 05:55:06,432 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1031 transitions. Word has length 109 [2025-03-09 05:55:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1031 transitions. [2025-03-09 05:55:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-09 05:55:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1031 transitions. [2025-03-09 05:55:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:55:06,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:06,433 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, 1] [2025-03-09 05:55:06,445 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-09 05:55:06,633 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,SelfDestructingSolverStorable25 [2025-03-09 05:55:06,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:06,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1649322135, now seen corresponding path program 1 times [2025-03-09 05:55:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44297440] [2025-03-09 05:55:06,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:06,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:06,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:06,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:06,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:10,690 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-09 05:55:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44297440] [2025-03-09 05:55:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44297440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552079887] [2025-03-09 05:55:10,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:10,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:10,692 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-09 05:55:10,694 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-09 05:55:11,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:11,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:11,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:11,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:11,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 05:55:11,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:11,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:11,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552079887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:11,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 22 [2025-03-09 05:55:11,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323147776] [2025-03-09 05:55:11,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 05:55:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:11,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 05:55:11,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-03-09 05:55:11,521 INFO L87 Difference]: Start difference. First operand 751 states and 1031 transitions. Second operand has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:19,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:55:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:20,151 INFO L93 Difference]: Finished difference Result 1842 states and 2628 transitions. [2025-03-09 05:55:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-09 05:55:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 110 [2025-03-09 05:55:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:20,156 INFO L225 Difference]: With dead ends: 1842 [2025-03-09 05:55:20,156 INFO L226 Difference]: Without dead ends: 1245 [2025-03-09 05:55:20,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=1757, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 05:55:20,157 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 3126 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 3080 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3135 SdHoareTripleChecker+Valid, 8037 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 3080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:20,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3135 Valid, 8037 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 3080 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-09 05:55:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-03-09 05:55:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 767. [2025-03-09 05:55:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 684 states have (on average 1.4035087719298245) internal successors, (960), 711 states have internal predecessors, (960), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1049 transitions. [2025-03-09 05:55:20,202 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1049 transitions. Word has length 110 [2025-03-09 05:55:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1049 transitions. [2025-03-09 05:55:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 05:55:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1049 transitions. [2025-03-09 05:55:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:55:20,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:20,204 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:55:20,216 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-09 05:55:20,404 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,SelfDestructingSolverStorable26 [2025-03-09 05:55:20,404 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:20,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2002288137, now seen corresponding path program 1 times [2025-03-09 05:55:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:20,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895644669] [2025-03-09 05:55:20,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:20,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:20,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:20,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:20,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:20,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895644669] [2025-03-09 05:55:20,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895644669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:20,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412535995] [2025-03-09 05:55:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:20,787 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-09 05:55:20,787 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-09 05:55:21,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:55:21,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:55:21,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:21,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:21,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 2522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:55:21,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:21,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:55:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412535995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:55:21,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:55:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:55:21,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437919112] [2025-03-09 05:55:21,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:55:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:21,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:55:21,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:55:21,657 INFO L87 Difference]: Start difference. First operand 767 states and 1049 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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-09 05:55:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:21,776 INFO L93 Difference]: Finished difference Result 870 states and 1160 transitions. [2025-03-09 05:55:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:55:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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 110 [2025-03-09 05:55:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:21,780 INFO L225 Difference]: With dead ends: 870 [2025-03-09 05:55:21,780 INFO L226 Difference]: Without dead ends: 869 [2025-03-09 05:55:21,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 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-09 05:55:21,783 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3182 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:21,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3182 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:55:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-09 05:55:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-03-09 05:55:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 786 states have (on average 1.3587786259541985) internal successors, (1068), 813 states have internal predecessors, (1068), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1157 transitions. [2025-03-09 05:55:21,819 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1157 transitions. Word has length 110 [2025-03-09 05:55:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:21,819 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1157 transitions. [2025-03-09 05:55:21,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 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-09 05:55:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1157 transitions. [2025-03-09 05:55:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 05:55:21,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:21,820 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 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-09 05:55:21,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 05:55:22,025 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,SelfDestructingSolverStorable27 [2025-03-09 05:55:22,025 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:22,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -999272866, now seen corresponding path program 1 times [2025-03-09 05:55:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128697815] [2025-03-09 05:55:22,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:22,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-09 05:55:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128697815] [2025-03-09 05:55:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128697815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459738259] [2025-03-09 05:55:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:27,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:27,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:27,080 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-09 05:55:27,082 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-09 05:55:27,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:27,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:27,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:27,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:27,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-09 05:55:27,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:27,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:27,935 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-09 05:55:27,976 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 05:55:27,976 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 19 treesize of output 16 [2025-03-09 05:55:27,985 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-09 05:55:28,019 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-09 05:55:28,058 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-09 05:55:28,097 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-09 05:55:28,124 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-09 05:55:28,153 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-09 05:55:28,182 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-09 05:55:28,213 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-09 05:55:28,248 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-09 05:55:28,278 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-09 05:55:28,313 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-09 05:55:28,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,337 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-09 05:55:28,373 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 05:55:28,373 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-09 05:55:28,396 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-09 05:55:28,426 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-09 05:55:28,426 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-09 05:55:28,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 217 treesize of output 132 [2025-03-09 05:55:28,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 223 treesize of output 138 [2025-03-09 05:55:28,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,526 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-03-09 05:55:28,526 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 2 case distinctions, treesize of input 132 treesize of output 109 [2025-03-09 05:55:28,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 39 [2025-03-09 05:55:28,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 223 treesize of output 138 [2025-03-09 05:55:28,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 229 treesize of output 144 [2025-03-09 05:55:28,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,567 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-09 05:55:28,568 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 2 case distinctions, treesize of input 138 treesize of output 120 [2025-03-09 05:55:28,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-09 05:55:28,594 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2025-03-09 05:55:28,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 40 [2025-03-09 05:55:28,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 173 treesize of output 100 [2025-03-09 05:55:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,636 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:55:28,636 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 103 [2025-03-09 05:55:28,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 179 treesize of output 106 [2025-03-09 05:55:28,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:28,661 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:55:28,662 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 109 [2025-03-09 05:55:28,764 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:28,764 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:28,783 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-09 05:55:28,886 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:28,887 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:28,896 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-09 05:55:28,991 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:28,991 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,009 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-09 05:55:29,080 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,080 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,094 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-09 05:55:29,183 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,183 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,189 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-09 05:55:29,289 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,289 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,294 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-09 05:55:29,367 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,367 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,381 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-09 05:55:29,460 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,460 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,479 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-09 05:55:29,596 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:29,596 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:29,603 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-09 05:55:29,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 26 [2025-03-09 05:55:29,712 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 16 treesize of output 11 [2025-03-09 05:55:29,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:29,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:29,896 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 05:55:29,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2025-03-09 05:55:29,997 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-09 05:55:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-09 05:55:30,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459738259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:30,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:55:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 26 [2025-03-09 05:55:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481492654] [2025-03-09 05:55:30,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 05:55:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:30,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 05:55:30,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=812, Unknown=3, NotChecked=0, Total=930 [2025-03-09 05:55:30,228 INFO L87 Difference]: Start difference. First operand 869 states and 1157 transitions. Second operand has 26 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 05:55:42,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:55:43,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 05:55:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:55:45,255 INFO L93 Difference]: Finished difference Result 2014 states and 2827 transitions. [2025-03-09 05:55:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 05:55:45,256 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 113 [2025-03-09 05:55:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:55:45,260 INFO L225 Difference]: With dead ends: 2014 [2025-03-09 05:55:45,260 INFO L226 Difference]: Without dead ends: 1411 [2025-03-09 05:55:45,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=308, Invalid=1495, Unknown=3, NotChecked=0, Total=1806 [2025-03-09 05:55:45,262 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 3010 mSDsluCounter, 8110 mSDsCounter, 0 mSdLazyCounter, 3990 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3012 SdHoareTripleChecker+Valid, 8770 SdHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 3990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:55:45,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3012 Valid, 8770 Invalid, 4298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 3990 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2025-03-09 05:55:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2025-03-09 05:55:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 869. [2025-03-09 05:55:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 786 states have (on average 1.3575063613231553) internal successors, (1067), 813 states have internal predecessors, (1067), 46 states have call successors, (46), 18 states have call predecessors, (46), 17 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2025-03-09 05:55:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1156 transitions. [2025-03-09 05:55:45,309 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1156 transitions. Word has length 113 [2025-03-09 05:55:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:55:45,309 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1156 transitions. [2025-03-09 05:55:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.6666666666666665) internal successors, (88), 26 states have internal predecessors, (88), 3 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 05:55:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1156 transitions. [2025-03-09 05:55:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 05:55:45,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:55:45,310 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 4, 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-09 05:55:45,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 05:55:45,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:45,510 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-09 05:55:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:55:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash -787921953, now seen corresponding path program 1 times [2025-03-09 05:55:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:55:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001838677] [2025-03-09 05:55:45,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:55:45,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:45,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:45,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:45,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:46,278 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-09 05:55:46,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:55:46,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001838677] [2025-03-09 05:55:46,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001838677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:46,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41551725] [2025-03-09 05:55:46,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:55:46,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:55:46,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:55:46,281 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:55:46,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 05:55:46,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 05:55:47,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 05:55:47,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:55:47,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:55:47,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-03-09 05:55:47,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:55:47,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,179 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-09 05:55:47,212 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 05:55:47,212 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 19 treesize of output 16 [2025-03-09 05:55:47,218 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-09 05:55:47,238 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-09 05:55:47,265 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-09 05:55:47,290 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-09 05:55:47,312 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-09 05:55:47,338 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-09 05:55:47,371 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-09 05:55:47,404 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-09 05:55:47,433 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-09 05:55:47,454 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-09 05:55:47,482 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-09 05:55:47,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,498 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-09 05:55:47,542 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 05:55:47,543 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-09 05:55:47,573 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-09 05:55:47,603 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-09 05:55:47,603 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-09 05:55:47,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 179 treesize of output 106 [2025-03-09 05:55:47,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,655 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:55:47,655 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 109 [2025-03-09 05:55:47,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 173 treesize of output 100 [2025-03-09 05:55:47,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,669 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-03-09 05:55:47,670 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 103 [2025-03-09 05:55:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 223 treesize of output 138 [2025-03-09 05:55:47,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 229 treesize of output 144 [2025-03-09 05:55:47,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,706 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-03-09 05:55:47,706 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 2 case distinctions, treesize of input 138 treesize of output 120 [2025-03-09 05:55:47,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 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-09 05:55:47,733 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2025-03-09 05:55:47,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 40 [2025-03-09 05:55:47,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 223 treesize of output 138 [2025-03-09 05:55:47,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,771 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-03-09 05:55:47,771 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 2 case distinctions, treesize of input 132 treesize of output 109 [2025-03-09 05:55:47,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 39 [2025-03-09 05:55:47,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 217 treesize of output 132 [2025-03-09 05:55:47,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:47,862 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:47,863 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:47,878 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-09 05:55:47,955 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:47,956 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:47,975 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-09 05:55:48,058 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,058 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,078 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-09 05:55:48,156 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,156 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,162 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-09 05:55:48,247 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,248 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,263 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-09 05:55:48,343 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,343 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,359 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-09 05:55:48,437 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,438 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,447 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-09 05:55:48,553 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,554 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,562 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-09 05:55:48,665 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 05:55:48,666 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2025-03-09 05:55:48,671 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-09 05:55:48,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 26 [2025-03-09 05:55:48,760 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 16 treesize of output 11 [2025-03-09 05:55:48,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:48,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 05:55:48,904 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 05:55:48,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2025-03-09 05:55:49,025 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-09 05:55:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-09 05:55:49,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:55:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41551725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:55:49,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:55:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 22 [2025-03-09 05:55:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124639973] [2025-03-09 05:55:49,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:55:49,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 05:55:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:55:49,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 05:55:49,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=663, Unknown=5, NotChecked=0, Total=756 [2025-03-09 05:55:49,414 INFO L87 Difference]: Start difference. First operand 869 states and 1156 transitions. Second operand has 22 states, 21 states have (on average 4.285714285714286) internal successors, (90), 22 states have internal predecessors, (90), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4)