./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 13:29:44,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 13:29:45,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-17 13:29:45,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 13:29:45,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 13:29:45,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 13:29:45,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 13:29:45,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 13:29:45,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 13:29:45,037 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 13:29:45,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 13:29:45,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 13:29:45,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 13:29:45,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 13:29:45,038 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 13:29:45,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:45,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 13:29:45,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 13:29:45,039 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> ddcc9d247afe7ee578ac42a6235418dbb1180c16aae89db83ebb72b439e4993a [2025-03-17 13:29:45,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 13:29:45,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 13:29:45,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 13:29:45,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 13:29:45,389 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 13:29:45,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-17 13:29:46,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46841e/a5f17bb3720b474f94ff8a185ad1bd28/FLAGc30d596fa [2025-03-17 13:29:46,936 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 13:29:46,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2025-03-17 13:29:46,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46841e/a5f17bb3720b474f94ff8a185ad1bd28/FLAGc30d596fa [2025-03-17 13:29:47,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7e46841e/a5f17bb3720b474f94ff8a185ad1bd28 [2025-03-17 13:29:47,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 13:29:47,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 13:29:47,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:47,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 13:29:47,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 13:29:47,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:47" (1/1) ... [2025-03-17 13:29:47,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:47, skipping insertion in model container [2025-03-17 13:29:47,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:47" (1/1) ... [2025-03-17 13:29:47,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 13:29:47,746 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,749 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,750 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,751 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,751 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,754 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,755 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,756 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,759 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,760 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,764 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,764 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,765 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,766 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,767 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,781 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,786 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 13:29:47,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:47,813 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 13:29:47,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 13:29:48,003 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-03-17 13:29:48,008 INFO L204 MainTranslator]: Completed translation [2025-03-17 13:29:48,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48 WrapperNode [2025-03-17 13:29:48,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 13:29:48,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:48,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 13:29:48,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 13:29:48,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,090 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 996 [2025-03-17 13:29:48,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 13:29:48,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 13:29:48,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 13:29:48,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 13:29:48,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,128 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 13:29:48,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 13:29:48,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 13:29:48,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 13:29:48,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 13:29:48,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (1/1) ... [2025-03-17 13:29:48,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 13:29:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:48,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 13:29:48,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 13:29:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2025-03-17 13:29:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 13:29:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 13:29:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-03-17 13:29:48,235 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-03-17 13:29:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2025-03-17 13:29:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 13:29:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 13:29:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 13:29:48,463 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 13:29:48,464 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 13:29:49,749 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2579: havoc bb_internal_getpwuid_#t~ret160#1.base, bb_internal_getpwuid_#t~ret160#1.offset; [2025-03-17 13:29:49,749 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2535: havoc getuid_#t~nondet148#1; [2025-03-17 13:29:49,749 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc find_applet_by_name_#t~nondet78#1; [2025-03-17 13:29:49,835 INFO L? ?]: Removed 452 outVars from TransFormulas that were not future-live. [2025-03-17 13:29:49,835 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 13:29:49,857 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 13:29:49,857 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 13:29:49,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:49 BoogieIcfgContainer [2025-03-17 13:29:49,857 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 13:29:49,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 13:29:49,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 13:29:49,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 13:29:49,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:47" (1/3) ... [2025-03-17 13:29:49,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f190c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:49, skipping insertion in model container [2025-03-17 13:29:49,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:48" (2/3) ... [2025-03-17 13:29:49,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f190c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:49, skipping insertion in model container [2025-03-17 13:29:49,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:49" (3/3) ... [2025-03-17 13:29:49,864 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2025-03-17 13:29:49,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 13:29:49,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 427 locations, 1 initial locations, 12 loop locations, and 177 error locations. [2025-03-17 13:29:49,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 13:29:49,928 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=None, 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;@33fd35ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 13:29:49,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 177 error locations. [2025-03-17 13:29:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 232 states have (on average 1.9698275862068966) internal successors, (457), 411 states have internal predecessors, (457), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 13:29:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:49,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:49,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:49,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:49,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash 17311, now seen corresponding path program 1 times [2025-03-17 13:29:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:49,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219320352] [2025-03-17 13:29:49,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:50,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:50,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:50,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219320352] [2025-03-17 13:29:50,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219320352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:50,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:50,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:50,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202537117] [2025-03-17 13:29:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:50,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:50,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:50,592 INFO L87 Difference]: Start difference. First operand has 427 states, 232 states have (on average 1.9698275862068966) internal successors, (457), 411 states have internal predecessors, (457), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:50,829 INFO L93 Difference]: Finished difference Result 286 states and 311 transitions. [2025-03-17 13:29:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:50,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 13:29:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:50,838 INFO L225 Difference]: With dead ends: 286 [2025-03-17 13:29:50,838 INFO L226 Difference]: Without dead ends: 284 [2025-03-17 13:29:50,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:50,841 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 209 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:50,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 247 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:29:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-17 13:29:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2025-03-17 13:29:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 147 states have (on average 1.8843537414965987) internal successors, (277), 258 states have internal predecessors, (277), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:29:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2025-03-17 13:29:50,882 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 2 [2025-03-17 13:29:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:50,883 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2025-03-17 13:29:50,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2025-03-17 13:29:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 13:29:50,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:50,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 13:29:50,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 13:29:50,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:50,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 17312, now seen corresponding path program 1 times [2025-03-17 13:29:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396039286] [2025-03-17 13:29:50,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:51,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 13:29:51,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 13:29:51,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:51,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:51,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:51,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396039286] [2025-03-17 13:29:51,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396039286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 13:29:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255568500] [2025-03-17 13:29:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:51,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:51,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:51,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:51,274 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:51,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:51,426 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2025-03-17 13:29:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:51,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 13:29:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:51,428 INFO L225 Difference]: With dead ends: 267 [2025-03-17 13:29:51,429 INFO L226 Difference]: Without dead ends: 267 [2025-03-17 13:29:51,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:51,429 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:51,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 457 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:29:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-17 13:29:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-17 13:29:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 147 states have (on average 1.8775510204081634) internal successors, (276), 257 states have internal predecessors, (276), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:29:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 291 transitions. [2025-03-17 13:29:51,446 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 291 transitions. Word has length 2 [2025-03-17 13:29:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:51,447 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 291 transitions. [2025-03-17 13:29:51,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2025-03-17 13:29:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:51,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:51,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 13:29:51,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:51,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 516185467, now seen corresponding path program 1 times [2025-03-17 13:29:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514980790] [2025-03-17 13:29:51,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:51,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:51,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:51,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:51,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:51,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:51,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514980790] [2025-03-17 13:29:51,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514980790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:51,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:51,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099596815] [2025-03-17 13:29:51,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:51,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:29:51,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:51,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:29:51,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:51,675 INFO L87 Difference]: Start difference. First operand 267 states and 291 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:52,322 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions. [2025-03-17 13:29:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:29:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:29:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:52,324 INFO L225 Difference]: With dead ends: 270 [2025-03-17 13:29:52,324 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 13:29:52,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:29:52,325 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 2 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:52,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 571 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 13:29:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 13:29:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2025-03-17 13:29:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 148 states have (on average 1.8716216216216217) internal successors, (277), 258 states have internal predecessors, (277), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:29:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2025-03-17 13:29:52,332 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 5 [2025-03-17 13:29:52,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:52,332 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2025-03-17 13:29:52,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:52,332 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2025-03-17 13:29:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 13:29:52,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:52,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 13:29:52,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 13:29:52,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:52,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 516185628, now seen corresponding path program 1 times [2025-03-17 13:29:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:52,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275696007] [2025-03-17 13:29:52,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:52,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 13:29:52,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 13:29:52,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:52,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:52,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:52,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275696007] [2025-03-17 13:29:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275696007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:29:52,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:29:52,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:29:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280130870] [2025-03-17 13:29:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:29:52,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 13:29:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:52,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 13:29:52,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:52,642 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:53,616 INFO L93 Difference]: Finished difference Result 269 states and 293 transitions. [2025-03-17 13:29:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:29:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 13:29:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:53,617 INFO L225 Difference]: With dead ends: 269 [2025-03-17 13:29:53,617 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 13:29:53,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:29:53,618 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 223 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:53,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 679 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:29:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 13:29:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2025-03-17 13:29:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 149 states have (on average 1.8590604026845639) internal successors, (277), 258 states have internal predecessors, (277), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:29:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2025-03-17 13:29:53,624 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 5 [2025-03-17 13:29:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:53,624 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2025-03-17 13:29:53,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2025-03-17 13:29:53,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:53,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:53,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:53,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 13:29:53,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:53,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1703562938, now seen corresponding path program 1 times [2025-03-17 13:29:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:53,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695996501] [2025-03-17 13:29:53,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:53,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:53,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:53,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:53,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695996501] [2025-03-17 13:29:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695996501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288447961] [2025-03-17 13:29:53,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:53,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:53,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:29:53,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 13:29:54,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:54,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:54,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:54,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:29:54,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:54,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:54,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288447961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:54,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:54,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:29:54,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392040192] [2025-03-17 13:29:54,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:54,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:29:54,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:54,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:29:54,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:54,215 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:29:55,582 INFO L93 Difference]: Finished difference Result 276 states and 302 transitions. [2025-03-17 13:29:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:29:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-17 13:29:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:29:55,583 INFO L225 Difference]: With dead ends: 276 [2025-03-17 13:29:55,583 INFO L226 Difference]: Without dead ends: 276 [2025-03-17 13:29:55,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:29:55,584 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 4 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:29:55,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 852 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:29:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-17 13:29:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-17 13:29:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 157 states have (on average 1.8280254777070064) internal successors, (287), 266 states have internal predecessors, (287), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:29:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 302 transitions. [2025-03-17 13:29:55,593 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 302 transitions. Word has length 8 [2025-03-17 13:29:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:29:55,593 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 302 transitions. [2025-03-17 13:29:55,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:29:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 302 transitions. [2025-03-17 13:29:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 13:29:55,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:29:55,598 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-17 13:29:55,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 13:29:55,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:55,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:29:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:29:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1703563099, now seen corresponding path program 1 times [2025-03-17 13:29:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:29:55,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845703227] [2025-03-17 13:29:55,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:29:55,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:55,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:55,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:55,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:29:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845703227] [2025-03-17 13:29:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845703227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:29:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949393889] [2025-03-17 13:29:56,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:29:56,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:29:56,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:29:56,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:29:56,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 13:29:56,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 13:29:56,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 13:29:56,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:29:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:29:56,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 13:29:56,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:29:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:56,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:29:56,700 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 7 treesize of output 5 [2025-03-17 13:29:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:29:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949393889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:29:56,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:29:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-17 13:29:56,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942296832] [2025-03-17 13:29:56,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:29:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 13:29:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:29:56,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 13:29:56,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:29:56,714 INFO L87 Difference]: Start difference. First operand 276 states and 302 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:30:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:00,877 INFO L93 Difference]: Finished difference Result 275 states and 299 transitions. [2025-03-17 13:30:00,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:30:00,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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-17 13:30:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:00,880 INFO L225 Difference]: With dead ends: 275 [2025-03-17 13:30:00,880 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 13:30:00,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:30:00,881 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 452 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:00,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1112 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-17 13:30:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 13:30:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-17 13:30:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 157 states have (on average 1.8089171974522293) internal successors, (284), 265 states have internal predecessors, (284), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 299 transitions. [2025-03-17 13:30:00,892 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 299 transitions. Word has length 8 [2025-03-17 13:30:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 299 transitions. [2025-03-17 13:30:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:30:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 299 transitions. [2025-03-17 13:30:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:30:00,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:00,893 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:30:00,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:01,093 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,SelfDestructingSolverStorable5 [2025-03-17 13:30:01,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:01,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1144073403, now seen corresponding path program 2 times [2025-03-17 13:30:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622977644] [2025-03-17 13:30:01,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-17 13:30:01,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 17 statements. [2025-03-17 13:30:01,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:30:01,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 13:30:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622977644] [2025-03-17 13:30:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622977644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:01,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747943645] [2025-03-17 13:30:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:01,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:01,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:01,401 INFO L87 Difference]: Start difference. First operand 275 states and 299 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-17 13:30:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:01,576 INFO L93 Difference]: Finished difference Result 290 states and 315 transitions. [2025-03-17 13:30:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 17 [2025-03-17 13:30:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:01,578 INFO L225 Difference]: With dead ends: 290 [2025-03-17 13:30:01,578 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 13:30:01,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:01,579 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 448 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:01,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 223 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 13:30:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 13:30:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 274. [2025-03-17 13:30:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 157 states have (on average 1.802547770700637) internal successors, (283), 264 states have internal predecessors, (283), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 298 transitions. [2025-03-17 13:30:01,586 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 298 transitions. Word has length 17 [2025-03-17 13:30:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 298 transitions. [2025-03-17 13:30:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-17 13:30:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 298 transitions. [2025-03-17 13:30:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 13:30:01,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:01,587 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2025-03-17 13:30:01,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 13:30:01,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:01,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:01,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1144073404, now seen corresponding path program 1 times [2025-03-17 13:30:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162158666] [2025-03-17 13:30:01,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:01,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:30:01,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:30:01,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:01,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162158666] [2025-03-17 13:30:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162158666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261416088] [2025-03-17 13:30:01,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:01,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:01,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:30:01,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 13:30:02,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 13:30:02,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 13:30:02,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:02,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:02,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 13:30:02,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:02,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 13:30:02,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261416088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:02,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:02,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-17 13:30:02,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732200192] [2025-03-17 13:30:02,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:02,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 13:30:02,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:02,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 13:30:02,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:30:02,273 INFO L87 Difference]: Start difference. First operand 274 states and 298 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:30:05,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:05,704 INFO L93 Difference]: Finished difference Result 292 states and 316 transitions. [2025-03-17 13:30:05,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 13:30:05,705 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 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 17 [2025-03-17 13:30:05,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:05,706 INFO L225 Difference]: With dead ends: 292 [2025-03-17 13:30:05,706 INFO L226 Difference]: Without dead ends: 292 [2025-03-17 13:30:05,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 13:30:05,706 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 1692 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:05,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1977 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 13:30:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-17 13:30:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-17 13:30:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 175 states have (on average 1.72) internal successors, (301), 282 states have internal predecessors, (301), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2025-03-17 13:30:05,713 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 17 [2025-03-17 13:30:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:05,713 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2025-03-17 13:30:05,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 13:30:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2025-03-17 13:30:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 13:30:05,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:05,715 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 13:30:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 13:30:05,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:05,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:05,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1950564252, now seen corresponding path program 2 times [2025-03-17 13:30:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196061554] [2025-03-17 13:30:05,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 13:30:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:05,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-03-17 13:30:06,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-03-17 13:30:06,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 13:30:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196061554] [2025-03-17 13:30:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196061554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5031874] [2025-03-17 13:30:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:06,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:06,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:06,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:06,246 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-17 13:30:06,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:06,370 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2025-03-17 13:30:06,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:06,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 35 [2025-03-17 13:30:06,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:06,372 INFO L225 Difference]: With dead ends: 295 [2025-03-17 13:30:06,372 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 13:30:06,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:06,373 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 9 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:06,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 462 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 13:30:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 13:30:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-03-17 13:30:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 178 states have (on average 1.702247191011236) internal successors, (303), 284 states have internal predecessors, (303), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 318 transitions. [2025-03-17 13:30:06,381 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 318 transitions. Word has length 35 [2025-03-17 13:30:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:06,381 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 318 transitions. [2025-03-17 13:30:06,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-17 13:30:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 318 transitions. [2025-03-17 13:30:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:30:06,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:06,382 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:06,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 13:30:06,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1521230110, now seen corresponding path program 1 times [2025-03-17 13:30:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807989103] [2025-03-17 13:30:06,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:30:06,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:30:06,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807989103] [2025-03-17 13:30:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807989103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:06,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:06,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:06,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817078228] [2025-03-17 13:30:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:06,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:06,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:06,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:06,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:06,717 INFO L87 Difference]: Start difference. First operand 295 states and 318 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:07,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:07,461 INFO L93 Difference]: Finished difference Result 306 states and 330 transitions. [2025-03-17 13:30:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 43 [2025-03-17 13:30:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:07,463 INFO L225 Difference]: With dead ends: 306 [2025-03-17 13:30:07,463 INFO L226 Difference]: Without dead ends: 306 [2025-03-17 13:30:07,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:07,464 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 189 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:07,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 247 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 13:30:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-17 13:30:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 290. [2025-03-17 13:30:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 178 states have (on average 1.6741573033707866) internal successors, (298), 279 states have internal predecessors, (298), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 313 transitions. [2025-03-17 13:30:07,471 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 313 transitions. Word has length 43 [2025-03-17 13:30:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:07,471 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 313 transitions. [2025-03-17 13:30:07,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 313 transitions. [2025-03-17 13:30:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 13:30:07,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:07,472 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 13:30:07,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:07,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1521230111, now seen corresponding path program 1 times [2025-03-17 13:30:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458217072] [2025-03-17 13:30:07,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:07,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 13:30:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 13:30:07,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:07,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:08,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:08,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458217072] [2025-03-17 13:30:08,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458217072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:08,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:08,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:30:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972580198] [2025-03-17 13:30:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:08,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:30:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:08,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:30:08,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:08,240 INFO L87 Difference]: Start difference. First operand 290 states and 313 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:09,257 INFO L93 Difference]: Finished difference Result 433 states and 476 transitions. [2025-03-17 13:30:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:09,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2025-03-17 13:30:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:09,259 INFO L225 Difference]: With dead ends: 433 [2025-03-17 13:30:09,259 INFO L226 Difference]: Without dead ends: 433 [2025-03-17 13:30:09,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:09,260 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 491 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:09,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 832 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 13:30:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-17 13:30:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 289. [2025-03-17 13:30:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 178 states have (on average 1.6685393258426966) internal successors, (297), 278 states have internal predecessors, (297), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 312 transitions. [2025-03-17 13:30:09,267 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 312 transitions. Word has length 43 [2025-03-17 13:30:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 312 transitions. [2025-03-17 13:30:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 312 transitions. [2025-03-17 13:30:09,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:30:09,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:09,271 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 13:30:09,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:09,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1528242643, now seen corresponding path program 1 times [2025-03-17 13:30:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751735737] [2025-03-17 13:30:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:09,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:30:09,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:30:09,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:09,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:09,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751735737] [2025-03-17 13:30:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751735737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 13:30:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285052607] [2025-03-17 13:30:09,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:09,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:30:09,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:09,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:30:09,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:09,711 INFO L87 Difference]: Start difference. First operand 289 states and 312 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-17 13:30:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:11,543 INFO L93 Difference]: Finished difference Result 323 states and 350 transitions. [2025-03-17 13:30:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 13:30:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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 46 [2025-03-17 13:30:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:11,544 INFO L225 Difference]: With dead ends: 323 [2025-03-17 13:30:11,544 INFO L226 Difference]: Without dead ends: 323 [2025-03-17 13:30:11,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:11,545 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 227 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:11,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 459 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 13:30:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-17 13:30:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 302. [2025-03-17 13:30:11,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 192 states have (on average 1.65625) internal successors, (318), 291 states have internal predecessors, (318), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 333 transitions. [2025-03-17 13:30:11,552 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 333 transitions. Word has length 46 [2025-03-17 13:30:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:11,552 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 333 transitions. [2025-03-17 13:30:11,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-17 13:30:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 333 transitions. [2025-03-17 13:30:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:30:11,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:11,553 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:11,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 13:30:11,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:11,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1528243572, now seen corresponding path program 1 times [2025-03-17 13:30:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:11,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572511186] [2025-03-17 13:30:11,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:11,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:30:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:30:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:11,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:11,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572511186] [2025-03-17 13:30:11,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572511186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:11,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:11,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009031537] [2025-03-17 13:30:11,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:11,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 13:30:11,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 13:30:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 13:30:11,802 INFO L87 Difference]: Start difference. First operand 302 states and 333 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-17 13:30:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:13,266 INFO L93 Difference]: Finished difference Result 313 states and 345 transitions. [2025-03-17 13:30:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 13:30:13,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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 46 [2025-03-17 13:30:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:13,268 INFO L225 Difference]: With dead ends: 313 [2025-03-17 13:30:13,268 INFO L226 Difference]: Without dead ends: 313 [2025-03-17 13:30:13,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 13:30:13,269 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 295 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:13,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 318 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 13:30:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-17 13:30:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 297. [2025-03-17 13:30:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 192 states have (on average 1.6302083333333333) internal successors, (313), 286 states have internal predecessors, (313), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 328 transitions. [2025-03-17 13:30:13,276 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 328 transitions. Word has length 46 [2025-03-17 13:30:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:13,276 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 328 transitions. [2025-03-17 13:30:13,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-17 13:30:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 328 transitions. [2025-03-17 13:30:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-17 13:30:13,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:13,277 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:13,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 13:30:13,277 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:13,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1528243571, now seen corresponding path program 1 times [2025-03-17 13:30:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525923620] [2025-03-17 13:30:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:13,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 13:30:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 13:30:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:13,691 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525923620] [2025-03-17 13:30:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525923620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429680305] [2025-03-17 13:30:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 13:30:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:13,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 13:30:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:13,693 INFO L87 Difference]: Start difference. First operand 297 states and 328 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-17 13:30:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:15,394 INFO L93 Difference]: Finished difference Result 302 states and 327 transitions. [2025-03-17 13:30:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 46 [2025-03-17 13:30:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:15,395 INFO L225 Difference]: With dead ends: 302 [2025-03-17 13:30:15,395 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 13:30:15,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 13:30:15,396 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 207 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:15,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1084 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 13:30:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 13:30:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2025-03-17 13:30:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 192 states have (on average 1.625) internal successors, (312), 286 states have internal predecessors, (312), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 327 transitions. [2025-03-17 13:30:15,401 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 327 transitions. Word has length 46 [2025-03-17 13:30:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:15,401 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 327 transitions. [2025-03-17 13:30:15,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-17 13:30:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 327 transitions. [2025-03-17 13:30:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:30:15,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:15,402 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:15,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 13:30:15,402 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:15,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1222817095, now seen corresponding path program 1 times [2025-03-17 13:30:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665290977] [2025-03-17 13:30:15,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:15,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:30:15,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:30:15,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:15,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:15,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665290977] [2025-03-17 13:30:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665290977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:15,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 13:30:15,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116768045] [2025-03-17 13:30:15,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:15,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:15,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:15,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:15,729 INFO L87 Difference]: Start difference. First operand 297 states and 327 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-17 13:30:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:16,497 INFO L93 Difference]: Finished difference Result 302 states and 334 transitions. [2025-03-17 13:30:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:16,497 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-17 13:30:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:16,498 INFO L225 Difference]: With dead ends: 302 [2025-03-17 13:30:16,498 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 13:30:16,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:16,500 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 177 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:16,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 243 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:30:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 13:30:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2025-03-17 13:30:16,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 197 states have (on average 1.619289340101523) internal successors, (319), 290 states have internal predecessors, (319), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 334 transitions. [2025-03-17 13:30:16,505 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 334 transitions. Word has length 49 [2025-03-17 13:30:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:16,506 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 334 transitions. [2025-03-17 13:30:16,506 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-17 13:30:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 334 transitions. [2025-03-17 13:30:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-17 13:30:16,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:16,507 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 13:30:16,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1222817094, now seen corresponding path program 1 times [2025-03-17 13:30:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217609795] [2025-03-17 13:30:16,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:16,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-17 13:30:16,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-17 13:30:16,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:16,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:17,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:17,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217609795] [2025-03-17 13:30:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217609795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:17,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814500977] [2025-03-17 13:30:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:17,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:17,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:17,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:17,271 INFO L87 Difference]: Start difference. First operand 301 states and 334 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:19,277 INFO L93 Difference]: Finished difference Result 305 states and 333 transitions. [2025-03-17 13:30:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-17 13:30:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:19,278 INFO L225 Difference]: With dead ends: 305 [2025-03-17 13:30:19,278 INFO L226 Difference]: Without dead ends: 305 [2025-03-17 13:30:19,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 13:30:19,279 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 31 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:19,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 657 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 13:30:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-17 13:30:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 301. [2025-03-17 13:30:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 197 states have (on average 1.614213197969543) internal successors, (318), 290 states have internal predecessors, (318), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 333 transitions. [2025-03-17 13:30:19,287 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 333 transitions. Word has length 49 [2025-03-17 13:30:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:19,287 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 333 transitions. [2025-03-17 13:30:19,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 333 transitions. [2025-03-17 13:30:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:30:19,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:19,287 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] [2025-03-17 13:30:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 13:30:19,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:19,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash 968973285, now seen corresponding path program 1 times [2025-03-17 13:30:19,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:19,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689373652] [2025-03-17 13:30:19,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:19,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:30:19,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:30:19,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:19,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689373652] [2025-03-17 13:30:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689373652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:19,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879414532] [2025-03-17 13:30:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:19,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:19,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:19,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:19,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:19,800 INFO L87 Difference]: Start difference. First operand 301 states and 333 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:22,254 INFO L93 Difference]: Finished difference Result 300 states and 331 transitions. [2025-03-17 13:30:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 13:30:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:22,255 INFO L225 Difference]: With dead ends: 300 [2025-03-17 13:30:22,255 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 13:30:22,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:30:22,256 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 178 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:22,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 789 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 13:30:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 13:30:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2025-03-17 13:30:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 197 states have (on average 1.6040609137055837) internal successors, (316), 289 states have internal predecessors, (316), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 331 transitions. [2025-03-17 13:30:22,260 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 331 transitions. Word has length 52 [2025-03-17 13:30:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:22,260 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 331 transitions. [2025-03-17 13:30:22,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 331 transitions. [2025-03-17 13:30:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 13:30:22,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:22,261 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] [2025-03-17 13:30:22,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 13:30:22,261 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:22,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:22,261 INFO L85 PathProgramCache]: Analyzing trace with hash 968973286, now seen corresponding path program 1 times [2025-03-17 13:30:22,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:22,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863003144] [2025-03-17 13:30:22,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:22,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:22,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 13:30:22,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 13:30:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863003144] [2025-03-17 13:30:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863003144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 13:30:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72499800] [2025-03-17 13:30:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:22,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:22,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:22,963 INFO L87 Difference]: Start difference. First operand 300 states and 331 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:25,311 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2025-03-17 13:30:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:25,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2025-03-17 13:30:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:25,314 INFO L225 Difference]: With dead ends: 299 [2025-03-17 13:30:25,314 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 13:30:25,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 13:30:25,315 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 179 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:25,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 797 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 13:30:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 13:30:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-03-17 13:30:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 197 states have (on average 1.5939086294416243) internal successors, (314), 288 states have internal predecessors, (314), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 329 transitions. [2025-03-17 13:30:25,319 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 329 transitions. Word has length 52 [2025-03-17 13:30:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:25,319 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 329 transitions. [2025-03-17 13:30:25,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 329 transitions. [2025-03-17 13:30:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 13:30:25,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:25,320 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:25,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 13:30:25,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:25,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2130289511, now seen corresponding path program 1 times [2025-03-17 13:30:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:25,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541339402] [2025-03-17 13:30:25,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:25,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:25,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 13:30:25,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 13:30:25,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:25,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541339402] [2025-03-17 13:30:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541339402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 13:30:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143697597] [2025-03-17 13:30:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 13:30:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:25,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 13:30:25,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:25,491 INFO L87 Difference]: Start difference. First operand 299 states and 329 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:26,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:26,251 INFO L93 Difference]: Finished difference Result 311 states and 344 transitions. [2025-03-17 13:30:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 13:30:26,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-03-17 13:30:26,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:26,254 INFO L225 Difference]: With dead ends: 311 [2025-03-17 13:30:26,255 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 13:30:26,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 13:30:26,255 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 6 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:26,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 533 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 13:30:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 13:30:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 301. [2025-03-17 13:30:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 199 states have (on average 1.5879396984924623) internal successors, (316), 290 states have internal predecessors, (316), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 331 transitions. [2025-03-17 13:30:26,262 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 331 transitions. Word has length 56 [2025-03-17 13:30:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:26,262 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 331 transitions. [2025-03-17 13:30:26,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 331 transitions. [2025-03-17 13:30:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:30:26,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:26,263 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] [2025-03-17 13:30:26,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 13:30:26,263 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:26,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:26,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1614218641, now seen corresponding path program 1 times [2025-03-17 13:30:26,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:26,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431207937] [2025-03-17 13:30:26,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:26,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:26,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:30:26,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:30:26,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:26,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431207937] [2025-03-17 13:30:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431207937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:26,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:26,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 13:30:26,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54870986] [2025-03-17 13:30:26,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:26,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 13:30:26,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:26,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 13:30:26,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 13:30:26,946 INFO L87 Difference]: Start difference. First operand 301 states and 331 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:31,552 INFO L93 Difference]: Finished difference Result 315 states and 346 transitions. [2025-03-17 13:30:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 13:30:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 57 [2025-03-17 13:30:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:31,553 INFO L225 Difference]: With dead ends: 315 [2025-03-17 13:30:31,554 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 13:30:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 13:30:31,554 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 199 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:31,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1036 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 13:30:31,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 13:30:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2025-03-17 13:30:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 205 states have (on average 1.5853658536585367) internal successors, (325), 296 states have internal predecessors, (325), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 340 transitions. [2025-03-17 13:30:31,561 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 340 transitions. Word has length 57 [2025-03-17 13:30:31,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:31,561 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 340 transitions. [2025-03-17 13:30:31,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 340 transitions. [2025-03-17 13:30:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 13:30:31,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:31,562 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] [2025-03-17 13:30:31,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 13:30:31,562 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:31,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1614218640, now seen corresponding path program 1 times [2025-03-17 13:30:31,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713503058] [2025-03-17 13:30:31,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:31,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 13:30:31,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 13:30:31,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:31,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713503058] [2025-03-17 13:30:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713503058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 13:30:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 13:30:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 13:30:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346769902] [2025-03-17 13:30:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 13:30:32,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 13:30:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:32,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 13:30:32,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 13:30:32,423 INFO L87 Difference]: Start difference. First operand 307 states and 340 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:35,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 13:30:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:35,972 INFO L93 Difference]: Finished difference Result 314 states and 344 transitions. [2025-03-17 13:30:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 13:30:35,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 57 [2025-03-17 13:30:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:35,974 INFO L225 Difference]: With dead ends: 314 [2025-03-17 13:30:35,974 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 13:30:35,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-17 13:30:35,974 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 206 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:35,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 694 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 13:30:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 13:30:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 307. [2025-03-17 13:30:35,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 205 states have (on average 1.575609756097561) internal successors, (323), 296 states have internal predecessors, (323), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 338 transitions. [2025-03-17 13:30:35,980 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 338 transitions. Word has length 57 [2025-03-17 13:30:35,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:35,981 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 338 transitions. [2025-03-17 13:30:35,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 338 transitions. [2025-03-17 13:30:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 13:30:35,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:35,982 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:35,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 13:30:35,983 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:35,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:35,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1168346828, now seen corresponding path program 1 times [2025-03-17 13:30:35,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377694846] [2025-03-17 13:30:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:30:36,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:30:36,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:36,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377694846] [2025-03-17 13:30:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377694846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496682953] [2025-03-17 13:30:36,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:36,188 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:30:36,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 13:30:36,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 13:30:36,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 13:30:36,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:36,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:36,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 13:30:36,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:36,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496682953] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 13:30:36,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 13:30:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 13:30:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739124164] [2025-03-17 13:30:36,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 13:30:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 13:30:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 13:30:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 13:30:36,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:36,713 INFO L87 Difference]: Start difference. First operand 307 states and 338 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 13:30:38,594 INFO L93 Difference]: Finished difference Result 336 states and 372 transitions. [2025-03-17 13:30:38,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 13:30:38,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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 61 [2025-03-17 13:30:38,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 13:30:38,597 INFO L225 Difference]: With dead ends: 336 [2025-03-17 13:30:38,597 INFO L226 Difference]: Without dead ends: 336 [2025-03-17 13:30:38,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 13:30:38,598 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 16 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-17 13:30:38,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1067 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-17 13:30:38,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-17 13:30:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 331. [2025-03-17 13:30:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 229 states have (on average 1.5589519650655022) internal successors, (357), 320 states have internal predecessors, (357), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 13:30:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 372 transitions. [2025-03-17 13:30:38,605 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 372 transitions. Word has length 61 [2025-03-17 13:30:38,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 13:30:38,605 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 372 transitions. [2025-03-17 13:30:38,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 13:30:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 372 transitions. [2025-03-17 13:30:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-17 13:30:38,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 13:30:38,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 13:30:38,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 13:30:38,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:38,810 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2025-03-17 13:30:38,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 13:30:38,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1859260060, now seen corresponding path program 1 times [2025-03-17 13:30:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 13:30:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468795559] [2025-03-17 13:30:38,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:38,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 13:30:38,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:30:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:30:38,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:38,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 13:30:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 13:30:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468795559] [2025-03-17 13:30:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468795559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 13:30:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633113793] [2025-03-17 13:30:39,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 13:30:39,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 13:30:39,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 13:30:39,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 13:30:39,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 13:30:39,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 13:30:39,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 13:30:39,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 13:30:39,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 13:30:39,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 13:30:39,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 13:30:39,908 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 10 treesize of output 8 [2025-03-17 13:30:39,937 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 13:30:39,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 13:30:39,965 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 13:30:40,014 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 34 treesize of output 27 [2025-03-17 13:30:40,098 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:30:40,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:30:40,150 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-17 13:30:40,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2025-03-17 13:30:40,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-03-17 13:30:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-17 13:30:40,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 13:30:40,240 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4678 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4678) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2025-03-17 13:30:40,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4678 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_4678) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2025-03-17 13:30:40,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4677 (Array Int Int)) (v_ArrVal_4678 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4677))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4678)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:30:40,358 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4676 (Array Int Int)) (v_ArrVal_4677 (Array Int Int)) (v_ArrVal_4678 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4676))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4677)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4678)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2025-03-17 13:30:40,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:40,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 71 [2025-03-17 13:30:40,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4920 treesize of output 3696 [2025-03-17 13:30:40,455 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 587 treesize of output 539 [2025-03-17 13:30:40,460 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 539 treesize of output 419 [2025-03-17 13:30:40,464 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 419 treesize of output 335 [2025-03-17 13:30:48,662 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 1801 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-17 13:30:48,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 13:30:48,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 373 treesize of output 3793