./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB --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-dev-d790fec [2024-11-28 04:38:39,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:38:39,097 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 04:38:39,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:38:39,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:38:39,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:38:39,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:38:39,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:38:39,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:38:39,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:38:39,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:38:39,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:38:39,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:38:39,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:38:39,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:38:39,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:38:39,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:38:39,160 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:38:39,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:38:39,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:38:39,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:38:39,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:38:39,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:38:39,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:38:39,163 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:38:39,163 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:38:39,163 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:38:39,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:38:39,163 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB 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 [2024-11-28 04:38:39,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:38:39,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:38:39,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:38:39,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:38:39,501 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:38:39,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-11-28 04:38:42,439 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/data/0bcf551a5/dbdfd51ab3524867b1440321b653152d/FLAG353bcd4e7 [2024-11-28 04:38:42,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:38:42,963 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/sv-benchmarks/c/busybox-1.22.0/chroot-incomplete-2.i [2024-11-28 04:38:42,994 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/data/0bcf551a5/dbdfd51ab3524867b1440321b653152d/FLAG353bcd4e7 [2024-11-28 04:38:43,018 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/data/0bcf551a5/dbdfd51ab3524867b1440321b653152d [2024-11-28 04:38:43,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:38:43,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:38:43,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:38:43,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:38:43,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:38:43,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:38:43" (1/1) ... [2024-11-28 04:38:43,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb03654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:43, skipping insertion in model container [2024-11-28 04:38:43,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:38:43" (1/1) ... [2024-11-28 04:38:43,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:38:44,259 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,262 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,264 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,265 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,266 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,267 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,268 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,268 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,270 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,273 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,275 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,278 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,279 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,287 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,287 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,289 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,290 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,292 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,309 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,320 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:38:44,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:38:44,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:38:44,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:38:44,756 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-28 04:38:44,764 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:38:44,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44 WrapperNode [2024-11-28 04:38:44,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:38:44,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:38:44,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:38:44,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:38:44,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,869 INFO L138 Inliner]: procedures = 615, calls = 586, calls flagged for inlining = 25, calls inlined = 23, statements flattened = 1006 [2024-11-28 04:38:44,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:38:44,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:38:44,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:38:44,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:38:44,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,949 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 04:38:44,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:44,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:45,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:45,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:45,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:45,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:38:45,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:38:45,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:38:45,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:38:45,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (1/1) ... [2024-11-28 04:38:45,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:38:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:38:45,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:38:45,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:38:45,171 INFO L130 BoogieDeclarations]: Found specification of procedure execvp [2024-11-28 04:38:45,172 INFO L138 BoogieDeclarations]: Found implementation of procedure execvp [2024-11-28 04:38:45,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:38:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-28 04:38:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 04:38:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 04:38:45,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:38:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:38:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 04:38:45,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:38:45,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:38:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-28 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-28 04:38:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-28 04:38:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 04:38:45,176 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg_and_die [2024-11-28 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg_and_die [2024-11-28 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 04:38:45,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 04:38:45,569 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:38:45,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:38:47,851 INFO L? ?]: Removed 469 outVars from TransFormulas that were not future-live. [2024-11-28 04:38:47,854 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:38:47,892 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:38:47,895 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-28 04:38:47,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:38:47 BoogieIcfgContainer [2024-11-28 04:38:47,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:38:47,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:38:47,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:38:47,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:38:47,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:38:43" (1/3) ... [2024-11-28 04:38:47,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f85af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:38:47, skipping insertion in model container [2024-11-28 04:38:47,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:38:44" (2/3) ... [2024-11-28 04:38:47,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314f85af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:38:47, skipping insertion in model container [2024-11-28 04:38:47,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:38:47" (3/3) ... [2024-11-28 04:38:47,908 INFO L128 eAbstractionObserver]: Analyzing ICFG chroot-incomplete-2.i [2024-11-28 04:38:47,927 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:38:47,929 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chroot-incomplete-2.i that has 5 procedures, 446 locations, 1 initial locations, 12 loop locations, and 177 error locations. [2024-11-28 04:38:48,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:38:48,022 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;@295f1fe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:38:48,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 177 error locations. [2024-11-28 04:38:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand has 446 states, 251 states have (on average 1.9163346613545817) internal successors, (481), 430 states have internal predecessors, (481), 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) [2024-11-28 04:38:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:38:48,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:48,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:38:48,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:38:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash 389323, now seen corresponding path program 1 times [2024-11-28 04:38:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:38:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205883060] [2024-11-28 04:38:48,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:38:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:38:49,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205883060] [2024-11-28 04:38:49,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205883060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:38:49,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:38:49,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:38:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750374769] [2024-11-28 04:38:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:38:49,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:38:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:38:49,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:38:49,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:38:49,240 INFO L87 Difference]: Start difference. First operand has 446 states, 251 states have (on average 1.9163346613545817) internal successors, (481), 430 states have internal predecessors, (481), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:38:50,284 INFO L93 Difference]: Finished difference Result 297 states and 322 transitions. [2024-11-28 04:38:50,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:38:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:38:50,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:38:50,298 INFO L225 Difference]: With dead ends: 297 [2024-11-28 04:38:50,298 INFO L226 Difference]: Without dead ends: 295 [2024-11-28 04:38:50,301 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 [2024-11-28 04:38:50,305 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 217 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:38:50,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 259 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:38:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-28 04:38:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 278. [2024-11-28 04:38:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 157 states have (on average 1.8280254777070064) internal successors, (287), 268 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) [2024-11-28 04:38:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 302 transitions. [2024-11-28 04:38:50,368 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 302 transitions. Word has length 3 [2024-11-28 04:38:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:38:50,368 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 302 transitions. [2024-11-28 04:38:50,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 302 transitions. [2024-11-28 04:38:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:38:50,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:50,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:38:50,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:38:50,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:38:50,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 389324, now seen corresponding path program 1 times [2024-11-28 04:38:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:38:50,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983669076] [2024-11-28 04:38:50,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:50,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:38:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:51,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:38:51,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983669076] [2024-11-28 04:38:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983669076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:38:51,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:38:51,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:38:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826796571] [2024-11-28 04:38:51,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:38:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:38:51,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:38:51,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:38:51,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:38:51,040 INFO L87 Difference]: Start difference. First operand 278 states and 302 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:52,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:38:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:38:52,825 INFO L93 Difference]: Finished difference Result 277 states and 301 transitions. [2024-11-28 04:38:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:38:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-28 04:38:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:38:52,828 INFO L225 Difference]: With dead ends: 277 [2024-11-28 04:38:52,828 INFO L226 Difference]: Without dead ends: 277 [2024-11-28 04:38:52,828 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 [2024-11-28 04:38:52,829 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 12 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:38:52,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 474 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-28 04:38:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-28 04:38:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-11-28 04:38:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 157 states have (on average 1.821656050955414) internal successors, (286), 267 states have internal predecessors, (286), 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) [2024-11-28 04:38:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 301 transitions. [2024-11-28 04:38:52,844 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 301 transitions. Word has length 3 [2024-11-28 04:38:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:38:52,844 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 301 transitions. [2024-11-28 04:38:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 301 transitions. [2024-11-28 04:38:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:38:52,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:52,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:38:52,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:38:52,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:38:52,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1218875501, now seen corresponding path program 1 times [2024-11-28 04:38:52,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:38:52,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758324638] [2024-11-28 04:38:52,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:38:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:38:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758324638] [2024-11-28 04:38:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758324638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:38:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:38:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:38:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900431034] [2024-11-28 04:38:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:38:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:38:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:38:53,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:38:53,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:38:53,464 INFO L87 Difference]: Start difference. First operand 277 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:38:54,486 INFO L93 Difference]: Finished difference Result 281 states and 305 transitions. [2024-11-28 04:38:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:38:54,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-28 04:38:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:38:54,489 INFO L225 Difference]: With dead ends: 281 [2024-11-28 04:38:54,489 INFO L226 Difference]: Without dead ends: 281 [2024-11-28 04:38:54,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:38:54,490 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 13 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:38:54,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 475 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-28 04:38:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-28 04:38:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2024-11-28 04:38:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 160 states have (on average 1.80625) internal successors, (289), 270 states have internal predecessors, (289), 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) [2024-11-28 04:38:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 304 transitions. [2024-11-28 04:38:54,514 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 304 transitions. Word has length 7 [2024-11-28 04:38:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:38:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 304 transitions. [2024-11-28 04:38:54,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:38:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 304 transitions. [2024-11-28 04:38:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:38:54,515 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:38:54,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:38:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:38:54,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:38:54,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:38:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2017947636, now seen corresponding path program 1 times [2024-11-28 04:38:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:38:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088781629] [2024-11-28 04:38:54,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:38:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:55,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:38:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088781629] [2024-11-28 04:38:55,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088781629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:38:55,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005868411] [2024-11-28 04:38:55,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:38:55,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:38:55,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:38:55,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:38:55,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:38:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:38:55,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:38:55,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:38:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:56,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:38:56,246 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 [2024-11-28 04:38:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:38:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005868411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:38:56,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:38:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-28 04:38:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872586836] [2024-11-28 04:38:56,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:38:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:38:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:38:56,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:38:56,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:38:56,272 INFO L87 Difference]: Start difference. First operand 280 states and 304 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) [2024-11-28 04:38:58,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:00,056 INFO L93 Difference]: Finished difference Result 285 states and 309 transitions. [2024-11-28 04:39:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:39:00,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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 11 [2024-11-28 04:39:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:00,058 INFO L225 Difference]: With dead ends: 285 [2024-11-28 04:39:00,059 INFO L226 Difference]: Without dead ends: 285 [2024-11-28 04:39:00,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:39:00,060 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 453 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:00,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1066 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-28 04:39:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-28 04:39:00,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-11-28 04:39:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 166 states have (on average 1.7710843373493976) internal successors, (294), 275 states have internal predecessors, (294), 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) [2024-11-28 04:39:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 309 transitions. [2024-11-28 04:39:00,072 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 309 transitions. Word has length 11 [2024-11-28 04:39:00,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:00,072 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 309 transitions. [2024-11-28 04:39:00,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 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) [2024-11-28 04:39:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 309 transitions. [2024-11-28 04:39:00,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-28 04:39:00,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:00,073 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:00,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:39:00,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:00,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:00,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2110286847, now seen corresponding path program 1 times [2024-11-28 04:39:00,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:00,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406065082] [2024-11-28 04:39:00,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:00,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406065082] [2024-11-28 04:39:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406065082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690084993] [2024-11-28 04:39:00,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:00,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:00,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:00,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:39:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:01,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 04:39:01,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:01,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690084993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:01,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-28 04:39:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294499261] [2024-11-28 04:39:01,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:01,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:39:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:01,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:39:01,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:39:01,629 INFO L87 Difference]: Start difference. First operand 285 states and 309 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2024-11-28 04:39:01,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:01,742 INFO L93 Difference]: Finished difference Result 305 states and 329 transitions. [2024-11-28 04:39:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 04:39:01,743 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 19 [2024-11-28 04:39:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:01,744 INFO L225 Difference]: With dead ends: 305 [2024-11-28 04:39:01,745 INFO L226 Difference]: Without dead ends: 305 [2024-11-28 04:39:01,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:39:01,747 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 6 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:01,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2057 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:39:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-28 04:39:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-28 04:39:01,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 186 states have (on average 1.6881720430107527) internal successors, (314), 295 states have internal predecessors, (314), 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) [2024-11-28 04:39:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 329 transitions. [2024-11-28 04:39:01,771 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 329 transitions. Word has length 19 [2024-11-28 04:39:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:01,771 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 329 transitions. [2024-11-28 04:39:01,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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) [2024-11-28 04:39:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 329 transitions. [2024-11-28 04:39:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 04:39:01,772 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:01,772 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:01,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:01,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:01,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:01,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:01,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1739554268, now seen corresponding path program 2 times [2024-11-28 04:39:01,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578146624] [2024-11-28 04:39:01,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:39:01,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:02,164 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:39:02,164 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:39:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-28 04:39:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578146624] [2024-11-28 04:39:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578146624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:02,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:39:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322509088] [2024-11-28 04:39:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:02,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:02,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:02,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:02,548 INFO L87 Difference]: Start difference. First operand 305 states and 329 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-28 04:39:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:02,852 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2024-11-28 04:39:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:39:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 39 [2024-11-28 04:39:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:02,854 INFO L225 Difference]: With dead ends: 321 [2024-11-28 04:39:02,854 INFO L226 Difference]: Without dead ends: 321 [2024-11-28 04:39:02,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:02,855 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 268 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:02,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 283 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 04:39:02,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-28 04:39:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 304. [2024-11-28 04:39:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 186 states have (on average 1.6827956989247312) internal successors, (313), 294 states have internal predecessors, (313), 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) [2024-11-28 04:39:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 328 transitions. [2024-11-28 04:39:02,869 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 328 transitions. Word has length 39 [2024-11-28 04:39:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:02,869 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 328 transitions. [2024-11-28 04:39:02,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2024-11-28 04:39:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 328 transitions. [2024-11-28 04:39:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-28 04:39:02,870 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:02,870 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:02,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:39:02,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:02,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:02,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1739554269, now seen corresponding path program 1 times [2024-11-28 04:39:02,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:02,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068656337] [2024-11-28 04:39:02,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068656337] [2024-11-28 04:39:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068656337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332712991] [2024-11-28 04:39:03,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:03,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:03,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:39:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:04,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:39:04,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:04,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:39:04,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332712991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:04,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:04,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-28 04:39:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512031100] [2024-11-28 04:39:04,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:04,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:39:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:39:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:39:04,553 INFO L87 Difference]: Start difference. First operand 304 states and 328 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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) [2024-11-28 04:39:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:04,648 INFO L93 Difference]: Finished difference Result 312 states and 336 transitions. [2024-11-28 04:39:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:39:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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 39 [2024-11-28 04:39:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:04,650 INFO L225 Difference]: With dead ends: 312 [2024-11-28 04:39:04,650 INFO L226 Difference]: Without dead ends: 312 [2024-11-28 04:39:04,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:39:04,651 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 3 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:04,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1469 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:39:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-28 04:39:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-28 04:39:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 194 states have (on average 1.6546391752577319) internal successors, (321), 302 states have internal predecessors, (321), 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) [2024-11-28 04:39:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 336 transitions. [2024-11-28 04:39:04,662 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 336 transitions. Word has length 39 [2024-11-28 04:39:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:04,662 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 336 transitions. [2024-11-28 04:39:04,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 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) [2024-11-28 04:39:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 336 transitions. [2024-11-28 04:39:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:39:04,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:04,663 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:04,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:39:04,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:04,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:04,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2658895, now seen corresponding path program 2 times [2024-11-28 04:39:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67753028] [2024-11-28 04:39:04,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:39:04,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:05,045 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:39:05,045 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:39:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67753028] [2024-11-28 04:39:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67753028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:05,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:39:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818305730] [2024-11-28 04:39:05,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:05,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:39:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:05,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:39:05,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:39:05,435 INFO L87 Difference]: Start difference. First operand 312 states and 336 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:39:07,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:07,639 INFO L93 Difference]: Finished difference Result 328 states and 353 transitions. [2024-11-28 04:39:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:07,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 47 [2024-11-28 04:39:07,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:07,641 INFO L225 Difference]: With dead ends: 328 [2024-11-28 04:39:07,641 INFO L226 Difference]: Without dead ends: 328 [2024-11-28 04:39:07,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:07,642 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 506 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:07,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 185 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:39:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-28 04:39:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 311. [2024-11-28 04:39:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 194 states have (on average 1.6494845360824741) internal successors, (320), 301 states have internal predecessors, (320), 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) [2024-11-28 04:39:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 335 transitions. [2024-11-28 04:39:07,656 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 335 transitions. Word has length 47 [2024-11-28 04:39:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:07,656 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 335 transitions. [2024-11-28 04:39:07,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2024-11-28 04:39:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 335 transitions. [2024-11-28 04:39:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:39:07,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:07,658 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:39:07,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2135073918, now seen corresponding path program 1 times [2024-11-28 04:39:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199330055] [2024-11-28 04:39:07,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199330055] [2024-11-28 04:39:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199330055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:39:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861366687] [2024-11-28 04:39:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:39:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:39:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:39:08,347 INFO L87 Difference]: Start difference. First operand 311 states and 335 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:09,470 INFO L93 Difference]: Finished difference Result 323 states and 348 transitions. [2024-11-28 04:39:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:39:09,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-28 04:39:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:09,472 INFO L225 Difference]: With dead ends: 323 [2024-11-28 04:39:09,472 INFO L226 Difference]: Without dead ends: 323 [2024-11-28 04:39:09,472 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 [2024-11-28 04:39:09,473 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 195 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:09,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-28 04:39:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-28 04:39:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 306. [2024-11-28 04:39:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 194 states have (on average 1.6237113402061856) internal successors, (315), 296 states have internal predecessors, (315), 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) [2024-11-28 04:39:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 330 transitions. [2024-11-28 04:39:09,484 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 330 transitions. Word has length 55 [2024-11-28 04:39:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:09,485 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 330 transitions. [2024-11-28 04:39:09,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 330 transitions. [2024-11-28 04:39:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:39:09,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:09,488 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:09,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:39:09,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash 2135073919, now seen corresponding path program 1 times [2024-11-28 04:39:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560593712] [2024-11-28 04:39:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:09,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560593712] [2024-11-28 04:39:10,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560593712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:10,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:10,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087314437] [2024-11-28 04:39:10,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:10,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:10,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:10,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:10,792 INFO L87 Difference]: Start difference. First operand 306 states and 330 transitions. Second operand has 7 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) [2024-11-28 04:39:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:12,391 INFO L93 Difference]: Finished difference Result 453 states and 497 transitions. [2024-11-28 04:39:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:39:12,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 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 55 [2024-11-28 04:39:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:12,394 INFO L225 Difference]: With dead ends: 453 [2024-11-28 04:39:12,394 INFO L226 Difference]: Without dead ends: 453 [2024-11-28 04:39:12,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:12,395 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 558 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:12,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 898 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-28 04:39:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-28 04:39:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 305. [2024-11-28 04:39:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 295 states have internal predecessors, (314), 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) [2024-11-28 04:39:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 329 transitions. [2024-11-28 04:39:12,405 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 329 transitions. Word has length 55 [2024-11-28 04:39:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:12,405 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 329 transitions. [2024-11-28 04:39:12,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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) [2024-11-28 04:39:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 329 transitions. [2024-11-28 04:39:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:39:12,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:12,406 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:12,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:39:12,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:12,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash 485243078, now seen corresponding path program 1 times [2024-11-28 04:39:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725074581] [2024-11-28 04:39:12,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:13,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:13,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725074581] [2024-11-28 04:39:13,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725074581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:13,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:13,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:39:13,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676325715] [2024-11-28 04:39:13,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:13,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:13,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:13,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:13,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:13,141 INFO L87 Difference]: Start difference. First operand 305 states and 329 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:13,625 INFO L93 Difference]: Finished difference Result 342 states and 370 transitions. [2024-11-28 04:39:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:39:13,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 04:39:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:13,627 INFO L225 Difference]: With dead ends: 342 [2024-11-28 04:39:13,627 INFO L226 Difference]: Without dead ends: 342 [2024-11-28 04:39:13,627 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 [2024-11-28 04:39:13,628 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 493 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:13,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 330 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 04:39:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-28 04:39:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 319. [2024-11-28 04:39:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 209 states have (on average 1.6076555023923444) internal successors, (336), 309 states have internal predecessors, (336), 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) [2024-11-28 04:39:13,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 351 transitions. [2024-11-28 04:39:13,642 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 351 transitions. Word has length 59 [2024-11-28 04:39:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 351 transitions. [2024-11-28 04:39:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 351 transitions. [2024-11-28 04:39:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:39:13,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:13,644 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:13,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:39:13,644 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 485246375, now seen corresponding path program 1 times [2024-11-28 04:39:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436889453] [2024-11-28 04:39:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:13,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:14,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:14,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436889453] [2024-11-28 04:39:14,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436889453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:14,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:14,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:39:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624770916] [2024-11-28 04:39:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:14,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:39:14,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:14,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:39:14,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:39:14,102 INFO L87 Difference]: Start difference. First operand 319 states and 351 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:15,140 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 [] [2024-11-28 04:39:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:16,465 INFO L93 Difference]: Finished difference Result 331 states and 364 transitions. [2024-11-28 04:39:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:39:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 04:39:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:16,467 INFO L225 Difference]: With dead ends: 331 [2024-11-28 04:39:16,467 INFO L226 Difference]: Without dead ends: 331 [2024-11-28 04:39:16,467 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 [2024-11-28 04:39:16,468 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 301 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:16,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 343 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-28 04:39:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-28 04:39:16,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 314. [2024-11-28 04:39:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 209 states have (on average 1.5837320574162679) internal successors, (331), 304 states have internal predecessors, (331), 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) [2024-11-28 04:39:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 346 transitions. [2024-11-28 04:39:16,478 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 346 transitions. Word has length 59 [2024-11-28 04:39:16,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:16,479 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 346 transitions. [2024-11-28 04:39:16,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:16,479 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 346 transitions. [2024-11-28 04:39:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:39:16,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:16,480 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:16,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:39:16,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:16,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 485246376, now seen corresponding path program 1 times [2024-11-28 04:39:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883957232] [2024-11-28 04:39:16,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:17,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883957232] [2024-11-28 04:39:17,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883957232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:17,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:17,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212782259] [2024-11-28 04:39:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:39:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:17,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:39:17,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:17,080 INFO L87 Difference]: Start difference. First operand 314 states and 346 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:17,229 INFO L93 Difference]: Finished difference Result 320 states and 346 transitions. [2024-11-28 04:39:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 04:39:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:17,231 INFO L225 Difference]: With dead ends: 320 [2024-11-28 04:39:17,231 INFO L226 Difference]: Without dead ends: 320 [2024-11-28 04:39:17,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:39:17,232 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 235 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:17,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1048 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:39:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-28 04:39:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 314. [2024-11-28 04:39:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 209 states have (on average 1.5789473684210527) internal successors, (330), 304 states have internal predecessors, (330), 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) [2024-11-28 04:39:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 345 transitions. [2024-11-28 04:39:17,243 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 345 transitions. Word has length 59 [2024-11-28 04:39:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:17,243 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 345 transitions. [2024-11-28 04:39:17,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:39:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 345 transitions. [2024-11-28 04:39:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:39:17,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:17,245 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:39:17,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:17,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -983034053, now seen corresponding path program 1 times [2024-11-28 04:39:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608184750] [2024-11-28 04:39:17,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:17,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:18,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:18,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608184750] [2024-11-28 04:39:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608184750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:18,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 04:39:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932803243] [2024-11-28 04:39:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:18,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 04:39:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:18,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 04:39:18,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 04:39:18,707 INFO L87 Difference]: Start difference. First operand 314 states and 345 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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) [2024-11-28 04:39:21,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:25,998 INFO L93 Difference]: Finished difference Result 467 states and 515 transitions. [2024-11-28 04:39:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:39:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 04:39:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:26,001 INFO L225 Difference]: With dead ends: 467 [2024-11-28 04:39:26,001 INFO L226 Difference]: Without dead ends: 467 [2024-11-28 04:39:26,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:39:26,002 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 520 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:26,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 958 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-28 04:39:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-28 04:39:26,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 315. [2024-11-28 04:39:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 211 states have (on average 1.5687203791469195) internal successors, (331), 305 states have internal predecessors, (331), 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) [2024-11-28 04:39:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 346 transitions. [2024-11-28 04:39:26,011 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 346 transitions. Word has length 62 [2024-11-28 04:39:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:26,011 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 346 transitions. [2024-11-28 04:39:26,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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) [2024-11-28 04:39:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 346 transitions. [2024-11-28 04:39:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:39:26,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:26,012 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:26,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:39:26,012 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1814873036, now seen corresponding path program 1 times [2024-11-28 04:39:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:26,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924627481] [2024-11-28 04:39:26,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:26,838 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:26,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924627481] [2024-11-28 04:39:26,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924627481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:26,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:26,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:26,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762736737] [2024-11-28 04:39:26,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:26,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:26,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:26,841 INFO L87 Difference]: Start difference. First operand 315 states and 346 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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) [2024-11-28 04:39:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:29,020 INFO L93 Difference]: Finished difference Result 314 states and 344 transitions. [2024-11-28 04:39:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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 65 [2024-11-28 04:39:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:29,022 INFO L225 Difference]: With dead ends: 314 [2024-11-28 04:39:29,023 INFO L226 Difference]: Without dead ends: 314 [2024-11-28 04:39:29,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:39:29,023 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 185 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:29,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 885 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-28 04:39:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-28 04:39:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-11-28 04:39:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 211 states have (on average 1.5592417061611374) internal successors, (329), 304 states have internal predecessors, (329), 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) [2024-11-28 04:39:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 344 transitions. [2024-11-28 04:39:29,032 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 344 transitions. Word has length 65 [2024-11-28 04:39:29,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:29,032 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 344 transitions. [2024-11-28 04:39:29,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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) [2024-11-28 04:39:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 344 transitions. [2024-11-28 04:39:29,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:39:29,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:29,033 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:39:29,034 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:29,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1814873037, now seen corresponding path program 1 times [2024-11-28 04:39:29,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:29,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364232946] [2024-11-28 04:39:29,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:30,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364232946] [2024-11-28 04:39:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364232946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:30,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:30,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:39:30,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991137487] [2024-11-28 04:39:30,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:30,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:39:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:30,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:39:30,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:39:30,210 INFO L87 Difference]: Start difference. First operand 314 states and 344 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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) [2024-11-28 04:39:31,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:32,657 INFO L93 Difference]: Finished difference Result 313 states and 342 transitions. [2024-11-28 04:39:32,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:39:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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 65 [2024-11-28 04:39:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:32,659 INFO L225 Difference]: With dead ends: 313 [2024-11-28 04:39:32,659 INFO L226 Difference]: Without dead ends: 313 [2024-11-28 04:39:32,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:39:32,659 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 184 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:32,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 782 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-28 04:39:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-28 04:39:32,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-11-28 04:39:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 211 states have (on average 1.5497630331753554) internal successors, (327), 303 states have internal predecessors, (327), 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) [2024-11-28 04:39:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 342 transitions. [2024-11-28 04:39:32,668 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 342 transitions. Word has length 65 [2024-11-28 04:39:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:32,668 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 342 transitions. [2024-11-28 04:39:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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) [2024-11-28 04:39:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 342 transitions. [2024-11-28 04:39:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:39:32,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:32,669 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:32,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:39:32,669 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:32,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:32,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2099389405, now seen corresponding path program 1 times [2024-11-28 04:39:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:32,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551252022] [2024-11-28 04:39:32,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:32,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:33,754 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551252022] [2024-11-28 04:39:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551252022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:33,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:39:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924519389] [2024-11-28 04:39:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:33,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:39:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:33,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:39:33,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:39:33,757 INFO L87 Difference]: Start difference. First operand 313 states and 342 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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) [2024-11-28 04:39:35,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:38,033 INFO L93 Difference]: Finished difference Result 334 states and 369 transitions. [2024-11-28 04:39:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:39:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 70 [2024-11-28 04:39:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:38,035 INFO L225 Difference]: With dead ends: 334 [2024-11-28 04:39:38,035 INFO L226 Difference]: Without dead ends: 334 [2024-11-28 04:39:38,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:39:38,036 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 389 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:38,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1124 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-28 04:39:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-28 04:39:38,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 321. [2024-11-28 04:39:38,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 219 states have (on average 1.552511415525114) internal successors, (340), 311 states have internal predecessors, (340), 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) [2024-11-28 04:39:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 355 transitions. [2024-11-28 04:39:38,044 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 355 transitions. Word has length 70 [2024-11-28 04:39:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:38,045 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 355 transitions. [2024-11-28 04:39:38,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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) [2024-11-28 04:39:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 355 transitions. [2024-11-28 04:39:38,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:39:38,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:38,046 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:38,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:39:38,046 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -2099389404, now seen corresponding path program 1 times [2024-11-28 04:39:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227498739] [2024-11-28 04:39:38,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:38,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227498739] [2024-11-28 04:39:39,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227498739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:39:39,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:39:39,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:39:39,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898893242] [2024-11-28 04:39:39,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:39:39,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:39:39,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:39,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:39:39,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:39:39,792 INFO L87 Difference]: Start difference. First operand 321 states and 355 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2024-11-28 04:39:40,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:46,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:47,300 INFO L93 Difference]: Finished difference Result 332 states and 364 transitions. [2024-11-28 04:39:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:39:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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 70 [2024-11-28 04:39:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:47,302 INFO L225 Difference]: With dead ends: 332 [2024-11-28 04:39:47,302 INFO L226 Difference]: Without dead ends: 332 [2024-11-28 04:39:47,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:39:47,303 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 205 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:47,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1132 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-28 04:39:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-28 04:39:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2024-11-28 04:39:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 219 states have (on average 1.5342465753424657) internal successors, (336), 311 states have internal predecessors, (336), 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) [2024-11-28 04:39:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 351 transitions. [2024-11-28 04:39:47,312 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 351 transitions. Word has length 70 [2024-11-28 04:39:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:47,312 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 351 transitions. [2024-11-28 04:39:47,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 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) [2024-11-28 04:39:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 351 transitions. [2024-11-28 04:39:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:39:47,312 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:47,313 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:47,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:39:47,313 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:47,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2088825277, now seen corresponding path program 1 times [2024-11-28 04:39:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611323527] [2024-11-28 04:39:47,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:47,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:39:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:39:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611323527] [2024-11-28 04:39:48,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611323527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:39:48,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039574741] [2024-11-28 04:39:48,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:48,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:39:48,617 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:39:48,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:39:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:39:49,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 04:39:49,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:39:49,369 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-28 04:39:49,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-28 04:39:49,509 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 04:39:49,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-28 04:39:49,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2024-11-28 04:39:49,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-28 04:39:49,714 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 33 treesize of output 26 [2024-11-28 04:39:49,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-28 04:39:49,798 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 23 treesize of output 7 [2024-11-28 04:39:49,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:39:49,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2024-11-28 04:39:49,984 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:39:49,984 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 [2024-11-28 04:39:50,062 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 [2024-11-28 04:39:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:39:50,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:39:50,099 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-11-28 04:39:50,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 04:39:50,115 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3832 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_3832) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem204#1.base|)) is different from false [2024-11-28 04:39:50,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3832 (Array Int Int))) (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3832) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-28 04:39:50,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3832 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem203#1.offset| 10))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base|) .cse0 (select v_ArrVal_3831 .cse0))) v_ArrVal_3831)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_3831)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (= (select (select (store .cse1 .cse2 v_ArrVal_3832) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) .cse2))))) is different from false [2024-11-28 04:39:50,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem203#1.offset_10| Int) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3832 (Array Int Int))) (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_3831))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3832) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (not (= (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_10| 10))) (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 (select v_ArrVal_3831 .cse4))) v_ArrVal_3831)) (< |v_ULTIMATE.start_main_#t~mem203#1.offset_10| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2024-11-28 04:39:50,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3829 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem203#1.offset_10| Int) (v_ArrVal_3830 (Array Int Int)) (v_ArrVal_3831 (Array Int Int)) (v_ArrVal_3832 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3830)) (.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (not (= (let ((.cse2 (+ |v_ULTIMATE.start_main_#t~mem203#1.offset_10| 10))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_3831 .cse2))) v_ArrVal_3831)) (< |v_ULTIMATE.start_main_#t~mem203#1.offset_10| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_3829) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (let ((.cse5 (store .cse0 .cse1 v_ArrVal_3831))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (= .cse4 (select (select (store .cse5 .cse4 v_ArrVal_3832) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) is different from false [2024-11-28 04:39:50,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:39:50,345 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 207 treesize of output 123 [2024-11-28 04:39:50,463 INFO L349 Elim1Store]: treesize reduction 14, result has 62.2 percent of original size [2024-11-28 04:39:50,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 14572 treesize of output 14000 [2024-11-28 04:39:50,653 INFO L349 Elim1Store]: treesize reduction 24, result has 58.6 percent of original size [2024-11-28 04:39:50,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 781 treesize of output 682 [2024-11-28 04:39:50,716 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 565 treesize of output 493 [2024-11-28 04:39:50,833 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:39:50,834 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 26 treesize of output 27 [2024-11-28 04:39:50,882 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 42 treesize of output 26 [2024-11-28 04:39:50,946 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 15 treesize of output 9 [2024-11-28 04:39:51,025 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-28 04:39:51,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:39:51,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2024-11-28 04:39:51,457 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 4 [2024-11-28 04:39:51,479 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 4 [2024-11-28 04:39:51,488 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 63 treesize of output 45 [2024-11-28 04:39:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-28 04:39:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039574741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:39:51,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:39:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2024-11-28 04:39:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878620173] [2024-11-28 04:39:51,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:39:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 04:39:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:39:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 04:39:51,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=384, Unknown=5, NotChecked=220, Total=702 [2024-11-28 04:39:51,656 INFO L87 Difference]: Start difference. First operand 321 states and 351 transitions. Second operand has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 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) [2024-11-28 04:39:53,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:39:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:39:59,596 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions. [2024-11-28 04:39:59,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 04:39:59,597 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 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 75 [2024-11-28 04:39:59,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:39:59,598 INFO L225 Difference]: With dead ends: 333 [2024-11-28 04:39:59,598 INFO L226 Difference]: Without dead ends: 333 [2024-11-28 04:39:59,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=230, Invalid=777, Unknown=5, NotChecked=320, Total=1332 [2024-11-28 04:39:59,599 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 468 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1223 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:39:59,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2106 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1147 Invalid, 0 Unknown, 1223 Unchecked, 7.3s Time] [2024-11-28 04:39:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-28 04:39:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 324. [2024-11-28 04:39:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 223 states have (on average 1.5246636771300448) internal successors, (340), 314 states have internal predecessors, (340), 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) [2024-11-28 04:39:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 355 transitions. [2024-11-28 04:39:59,608 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 355 transitions. Word has length 75 [2024-11-28 04:39:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:39:59,608 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 355 transitions. [2024-11-28 04:39:59,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8461538461538463) internal successors, (74), 27 states have internal predecessors, (74), 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) [2024-11-28 04:39:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 355 transitions. [2024-11-28 04:39:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:39:59,610 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:39:59,610 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:39:59,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:39:59,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:39:59,811 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:39:59,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:39:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2088825278, now seen corresponding path program 1 times [2024-11-28 04:39:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:39:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225446900] [2024-11-28 04:39:59,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:39:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225446900] [2024-11-28 04:40:01,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225446900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97641959] [2024-11-28 04:40:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:40:01,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:01,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:01,848 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:01,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:40:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:40:02,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-28 04:40:02,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:02,566 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 [2024-11-28 04:40:02,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:02,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:40:02,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-28 04:40:02,646 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 [2024-11-28 04:40:02,707 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 21 treesize of output 16 [2024-11-28 04:40:02,711 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 20 treesize of output 15 [2024-11-28 04:40:02,800 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:40:02,801 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 84 treesize of output 79 [2024-11-28 04:40:02,807 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 59 treesize of output 36 [2024-11-28 04:40:02,988 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:40:02,988 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 84 treesize of output 79 [2024-11-28 04:40:02,996 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 59 treesize of output 36 [2024-11-28 04:40:03,074 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 47 treesize of output 23 [2024-11-28 04:40:03,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2024-11-28 04:40:03,131 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:03,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:03,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4267 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_4267 (Array Int Int)) (v_ArrVal_4268 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4268) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:40:03,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4267 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_4267 (Array Int Int)) (v_ArrVal_4268 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4268) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:40:03,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:03,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 100 [2024-11-28 04:40:03,525 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4268 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4268)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~mem203#1.base|)) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_prenex_2) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_prenex_1) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_prenex_3) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4267 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4266) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4265) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem203#1.offset| 10))))) is different from false [2024-11-28 04:40:03,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4267 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4266) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4265) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4267) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 10))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_2) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_prenex_1) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_prenex_3) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4268 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4265))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4268)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse0))))) is different from false [2024-11-28 04:40:03,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4264 (Array Int Int)) (v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4268 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4264))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_4265))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4268)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse3)))) (forall ((v_ArrVal_4263 (Array Int Int)) (v_ArrVal_4264 (Array Int Int)) (v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4266 (Array Int Int)) (v_ArrVal_4267 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4263))) (< (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4264))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store .cse4 .cse5 v_ArrVal_4266) (select (select (store .cse6 .cse5 v_ArrVal_4265) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4267))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (+ (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 10)))) (forall ((v_ArrVal_4263 (Array Int Int)) (v_ArrVal_4264 (Array Int Int)) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4264))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4263) .cse7 v_prenex_2) (select (select (store .cse8 .cse7 v_prenex_1) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_prenex_3))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2024-11-28 04:40:03,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:03,669 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 127 treesize of output 80 [2024-11-28 04:40:03,676 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 4836 treesize of output 3532 [2024-11-28 04:40:03,710 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 162 treesize of output 120 [2024-11-28 04:40:03,715 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 120 treesize of output 102 [2024-11-28 04:40:03,720 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 76 treesize of output 40 [2024-11-28 04:40:03,748 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 04:40:03,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 1 [2024-11-28 04:40:03,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2024-11-28 04:40:03,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:03,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2024-11-28 04:40:03,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:03,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 61 [2024-11-28 04:40:03,779 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:03,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:03,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 04:40:03,952 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:40:03,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 04:40:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-28 04:40:03,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97641959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:40:03,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:40:03,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 32 [2024-11-28 04:40:03,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816558813] [2024-11-28 04:40:03,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:03,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-28 04:40:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:03,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-28 04:40:03,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=639, Unknown=14, NotChecked=280, Total=1056 [2024-11-28 04:40:03,968 INFO L87 Difference]: Start difference. First operand 324 states and 355 transitions. Second operand has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 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) [2024-11-28 04:40:05,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:40:09,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:40:10,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:40:15,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:15,679 INFO L93 Difference]: Finished difference Result 341 states and 372 transitions. [2024-11-28 04:40:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:40:15,679 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 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 75 [2024-11-28 04:40:15,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:15,681 INFO L225 Difference]: With dead ends: 341 [2024-11-28 04:40:15,681 INFO L226 Difference]: Without dead ends: 341 [2024-11-28 04:40:15,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=965, Unknown=15, NotChecked=350, Total=1560 [2024-11-28 04:40:15,682 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 598 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 2472 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1926 Invalid, 0 Unknown, 1218 Unchecked, 11.2s Time] [2024-11-28 04:40:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-28 04:40:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2024-11-28 04:40:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 233 states have (on average 1.5064377682403434) internal successors, (351), 324 states have internal predecessors, (351), 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) [2024-11-28 04:40:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 366 transitions. [2024-11-28 04:40:15,689 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 366 transitions. Word has length 75 [2024-11-28 04:40:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 366 transitions. [2024-11-28 04:40:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.375) internal successors, (76), 33 states have internal predecessors, (76), 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) [2024-11-28 04:40:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 366 transitions. [2024-11-28 04:40:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 04:40:15,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:15,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:15,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:40:15,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:15,892 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:40:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash -313701276, now seen corresponding path program 2 times [2024-11-28 04:40:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:15,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131809890] [2024-11-28 04:40:15,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:40:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:16,157 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:40:16,158 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:40:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:17,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131809890] [2024-11-28 04:40:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131809890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943140766] [2024-11-28 04:40:17,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:40:17,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:17,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:17,932 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:17,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:40:21,077 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:40:21,077 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:40:21,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1588 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-28 04:40:21,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:21,100 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 [2024-11-28 04:40:21,132 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:21,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:40:21,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:40:21,180 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 [2024-11-28 04:40:21,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 04:40:21,264 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 [2024-11-28 04:40:21,271 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 20 treesize of output 15 [2024-11-28 04:40:21,388 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:40:21,389 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 74 treesize of output 69 [2024-11-28 04:40:21,402 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 36 treesize of output 15 [2024-11-28 04:40:21,615 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:40:21,616 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 74 treesize of output 69 [2024-11-28 04:40:21,628 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 36 treesize of output 15 [2024-11-28 04:40:21,792 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:40:21,792 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 74 treesize of output 69 [2024-11-28 04:40:21,802 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 36 treesize of output 15 [2024-11-28 04:40:21,887 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 [2024-11-28 04:40:21,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-28 04:40:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:21,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:22,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4718 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:40:22,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_4718 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-28 04:40:22,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_4718 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:40:22,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4716) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4717))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_4716) .cse1 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-28 04:40:22,180 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4717))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4716) .cse1 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4716) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-28 04:40:22,212 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4716) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4717))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4716) .cse2 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-28 04:40:22,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4715))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_4717))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4714) .cse0 v_ArrVal_4716) .cse1 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4715))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_4714) .cse5 v_ArrVal_4716) (select (select (store .cse6 .cse5 v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_4718))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))))) is different from false [2024-11-28 04:40:22,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4715))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4714) .cse1 v_ArrVal_4716) (select (select (store .cse2 .cse1 v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_4718))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4715))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_4717))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4714) .cse4 v_ArrVal_4716) .cse5 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))))) is different from false [2024-11-28 04:40:22,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4712 (Array Int Int)) (v_ArrVal_4713 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4713))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_4715))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4712) .cse0 v_ArrVal_4714) .cse1 v_ArrVal_4716) (select (select (store .cse2 .cse1 v_ArrVal_4717) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_4718))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 2))) (forall ((v_ArrVal_4718 (Array Int Int)) (v_ArrVal_4719 (Array Int Int)) (v_ArrVal_4712 (Array Int Int)) (v_ArrVal_4713 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4715 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4713))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_4715))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_4717))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_4712) .cse5 v_ArrVal_4714) .cse6 v_ArrVal_4716) .cse7 v_ArrVal_4718) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_4719) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-28 04:40:22,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:22,336 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 210 treesize of output 211 [2024-11-28 04:40:22,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:22,347 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 198 treesize of output 127 [2024-11-28 04:40:22,362 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 34390 treesize of output 28718 [2024-11-28 04:40:22,545 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 22218 treesize of output 21490 [2024-11-28 04:40:22,661 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 1953 treesize of output 1665 [2024-11-28 04:40:22,683 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 1665 treesize of output 1461 [2024-11-28 04:40:22,708 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 889 treesize of output 847 [2024-11-28 04:40:22,733 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 1419 treesize of output 1335 [2024-11-28 04:40:22,757 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 1335 treesize of output 1167 [2024-11-28 04:40:22,779 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 1167 treesize of output 1059 [2024-11-28 04:40:22,797 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 1059 treesize of output 1023 [2024-11-28 04:40:23,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:23,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 418 [2024-11-28 04:40:23,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:23,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 238 [2024-11-28 04:40:23,330 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:23,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13094 treesize of output 9486 [2024-11-28 04:40:23,363 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:23,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:40:23,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-28 04:40:23,489 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:40:23,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 04:40:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 13 not checked. [2024-11-28 04:40:23,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943140766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:40:23,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:40:23,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2024-11-28 04:40:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799618230] [2024-11-28 04:40:23,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:40:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-28 04:40:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:40:23,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-28 04:40:23,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=760, Unknown=9, NotChecked=576, Total=1482 [2024-11-28 04:40:23,500 INFO L87 Difference]: Start difference. First operand 334 states and 366 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 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) [2024-11-28 04:40:25,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:40:28,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:40:35,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:40:35,541 INFO L93 Difference]: Finished difference Result 351 states and 383 transitions. [2024-11-28 04:40:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 04:40:35,541 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 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 80 [2024-11-28 04:40:35,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:40:35,543 INFO L225 Difference]: With dead ends: 351 [2024-11-28 04:40:35,543 INFO L226 Difference]: Without dead ends: 351 [2024-11-28 04:40:35,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=264, Invalid=1245, Unknown=9, NotChecked=738, Total=2256 [2024-11-28 04:40:35,548 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 232 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 4117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2297 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:40:35,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 2267 Invalid, 4117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1807 Invalid, 0 Unknown, 2297 Unchecked, 11.1s Time] [2024-11-28 04:40:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-28 04:40:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2024-11-28 04:40:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 334 states have internal predecessors, (362), 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) [2024-11-28 04:40:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 377 transitions. [2024-11-28 04:40:35,556 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 377 transitions. Word has length 80 [2024-11-28 04:40:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:40:35,557 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 377 transitions. [2024-11-28 04:40:35,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 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) [2024-11-28 04:40:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 377 transitions. [2024-11-28 04:40:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-28 04:40:35,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:40:35,558 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:40:35,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 04:40:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 04:40:35,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:40:35,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:40:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash -882005634, now seen corresponding path program 3 times [2024-11-28 04:40:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:40:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637796049] [2024-11-28 04:40:35,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:40:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:40:36,325 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:40:36,325 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:40:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:40:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637796049] [2024-11-28 04:40:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637796049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:40:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215147010] [2024-11-28 04:40:38,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:40:38,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:40:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:40:38,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:40:38,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 04:40:50,949 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:40:50,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:40:50,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-28 04:40:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:40:50,977 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 [2024-11-28 04:40:51,121 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:40:51,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:40:51,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:40:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 04:40:51,226 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 15 treesize of output 1 [2024-11-28 04:40:51,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-28 04:40:51,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-28 04:40:51,451 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:40:51,451 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 45 [2024-11-28 04:40:51,460 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 24 treesize of output 11 [2024-11-28 04:40:51,644 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:40:51,644 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 45 [2024-11-28 04:40:51,654 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 24 treesize of output 11 [2024-11-28 04:40:51,886 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:40:51,886 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 45 [2024-11-28 04:40:51,893 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 24 treesize of output 11 [2024-11-28 04:40:52,096 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-28 04:40:52,097 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 45 [2024-11-28 04:40:52,110 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 33 treesize of output 18 [2024-11-28 04:40:52,300 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 25 treesize of output 13 [2024-11-28 04:40:52,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-28 04:40:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:40:52,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:40:52,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5181))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1) 0) (forall ((v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5182))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse0 .cse2 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) (forall ((v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5181))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (forall ((v_ArrVal_5183 (Array Int Int))) (< .cse4 (+ 2 (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (< (+ .cse4 |c_ULTIMATE.start_main_~j~0#1| 1) 0))))))) is different from false [2024-11-28 04:40:52,972 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (or (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse0 1) 0) (forall ((v_ArrVal_5183 (Array Int Int))) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5181))) (or (forall ((v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5182))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (< (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store .cse4 .cse5 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 1) 0))))))) is different from false [2024-11-28 04:40:53,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5179))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5180) .cse3 v_ArrVal_5181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ .cse0 |c_ULTIMATE.start_main_~j~0#1| 2) 0))))))) (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5179))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem204#1.base| v_ArrVal_5180) .cse9 v_ArrVal_5181))) (or (let ((.cse7 (store .cse8 .cse9 v_ArrVal_5182))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse5 .cse6 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) |c_ULTIMATE.start_main_~j~0#1| 2) 0)))))))) is different from false [2024-11-28 04:40:53,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_5179))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_5180) .cse5 v_ArrVal_5181))) (or (let ((.cse3 (store .cse4 .cse5 v_ArrVal_5182))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store .cse0 .cse1 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) (< (+ |c_ULTIMATE.start_main_~j~0#1| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) 0)))))) (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_5179))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_5180) .cse10 v_ArrVal_5181))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (or (< .cse7 (+ (select (select (store .cse8 (select (select (store .cse9 .cse10 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2)) (< (+ |c_ULTIMATE.start_main_~j~0#1| .cse7 2) 0)))))))))) is different from false [2024-11-28 04:40:53,371 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_5179))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_5180) .cse3 v_ArrVal_5181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2)) (< (+ .cse0 2) 0))))))) (forall ((v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_5179))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_5180) .cse10 v_ArrVal_5181))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2) 0) (let ((.cse8 (store .cse9 .cse10 v_ArrVal_5182))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse6 .cse7 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))) is different from false [2024-11-28 04:40:53,427 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5178))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse6 .cse5 v_ArrVal_5179))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5177) .cse5 v_ArrVal_5180) .cse3 v_ArrVal_5181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< .cse0 (+ (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2)) (< (+ .cse0 2) 0))))))))) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5178))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_5179))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem203#1.base| v_ArrVal_5177) .cse12 v_ArrVal_5180) .cse11 v_ArrVal_5181))) (or (let ((.cse9 (store .cse10 .cse11 v_ArrVal_5182))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ (select (select (store .cse7 .cse8 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 3) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))) (< (+ (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2) 0)))))))))) is different from false [2024-11-28 04:40:53,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_5178))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse2 (store .cse7 .cse6 v_ArrVal_5179))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_5177) .cse6 v_ArrVal_5180) .cse3 v_ArrVal_5181))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (or (< (+ .cse0 2) 0) (< .cse0 (+ 2 (select (select (store .cse1 (select (select (store .cse2 .cse3 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))) (forall ((v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_5178))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_5179))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_5177) .cse13 v_ArrVal_5180) .cse12 v_ArrVal_5181))) (or (< (+ (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 2) 0) (let ((.cse10 (store .cse11 .cse12 v_ArrVal_5182))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (< (+ 3 (select (select (store .cse8 .cse9 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))))))))))) is different from false [2024-11-28 04:40:53,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_5176 (Array Int Int)) (v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5176))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_5178))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_5179))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5175) .cse6 v_ArrVal_5177) .cse7 v_ArrVal_5180) .cse5 v_ArrVal_5181))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_5182))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (< (+ (select (select (store .cse0 .cse2 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))))))) (forall ((v_ArrVal_5176 (Array Int Int)) (v_ArrVal_5175 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (v_ArrVal_5177 (Array Int Int)) (v_ArrVal_5179 (Array Int Int)) (v_ArrVal_5181 (Array Int Int)) (v_ArrVal_5180 (Array Int Int)) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5176))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse16 (store .cse17 .cse14 v_ArrVal_5178))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse12 (store .cse16 .cse15 v_ArrVal_5179))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse11 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_5175) .cse14 v_ArrVal_5177) .cse15 v_ArrVal_5180) .cse13 v_ArrVal_5181))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< (+ .cse10 2) 0) (< .cse10 (+ (select (select (store .cse11 (select (select (store .cse12 .cse13 v_ArrVal_5182) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2)))))))))))))) is different from false [2024-11-28 04:40:53,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:53,767 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 1044 treesize of output 1032 [2024-11-28 04:40:53,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:40:53,781 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 1020 treesize of output 576 [2024-11-28 04:40:54,809 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 524984191 treesize of output 496085319 [2024-11-28 04:40:59,866 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 25749931 treesize of output 25542531 [2024-11-28 04:41:00,265 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 900 treesize of output 852 [2024-11-28 04:41:00,277 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 852 treesize of output 804 [2024-11-28 04:41:00,289 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 804 treesize of output 672 [2024-11-28 04:41:00,301 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 1097 treesize of output 1025 [2024-11-28 04:41:00,315 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 1025 treesize of output 881 [2024-11-28 04:41:00,329 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 881 treesize of output 833 [2024-11-28 04:41:00,342 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 833 treesize of output 701 [2024-11-28 04:41:00,360 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 364 treesize of output 298 [2024-11-28 04:41:00,369 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 635 treesize of output 611 [2024-11-28 04:41:00,385 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 286 treesize of output 274 [2024-11-28 04:41:00,805 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 04:41:00,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 834 treesize of output 1 [2024-11-28 04:41:00,965 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:41:00,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 04:41:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 190 trivial. 20 not checked. [2024-11-28 04:41:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215147010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:41:00,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:41:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 49 [2024-11-28 04:41:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778923548] [2024-11-28 04:41:00,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:00,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-28 04:41:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-28 04:41:00,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1518, Unknown=23, NotChecked=696, Total=2450 [2024-11-28 04:41:00,977 INFO L87 Difference]: Start difference. First operand 344 states and 377 transitions. Second operand has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 50 states have internal predecessors, (110), 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) [2024-11-28 04:41:02,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:41:03,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:41:10,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:41:15,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse0 (+ .cse3 |c_ULTIMATE.start_main_~j~0#1|))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_5183 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) (<= (+ .cse3 |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| .cse1)) (not (= |c_ULTIMATE.start_main_~argv~0#1.base| |c_ULTIMATE.start_main_~mem_track~0#1.base|)) (= |c_ULTIMATE.start_main_~i~4#1| 0) (= 0 |c_ULTIMATE.start_main_~argv~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~argv~0#1.base|) 1) (<= 0 .cse0))))) is different from false [2024-11-28 04:41:15,048 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (.cse0 (+ .cse3 |c_ULTIMATE.start_main_~j~0#1|))) (and (or (< .cse0 0) (and (forall ((v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_5184) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_5183 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5183) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))))) (<= (+ .cse3 |c_ULTIMATE.start_main_~j~0#1| 1) (select |c_#length| .cse1)) (<= 0 .cse0))))) is different from false [2024-11-28 04:41:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:17,089 INFO L93 Difference]: Finished difference Result 364 states and 399 transitions. [2024-11-28 04:41:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 04:41:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 50 states have internal predecessors, (110), 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 85 [2024-11-28 04:41:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:17,092 INFO L225 Difference]: With dead ends: 364 [2024-11-28 04:41:17,092 INFO L226 Difference]: Without dead ends: 364 [2024-11-28 04:41:17,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 139 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=576, Invalid=2731, Unknown=39, NotChecked=1210, Total=4556 [2024-11-28 04:41:17,095 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 229 mSDsluCounter, 4057 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 37 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 4327 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 1370 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:17,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 4327 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1669 Invalid, 27 Unknown, 1370 Unchecked, 13.5s Time] [2024-11-28 04:41:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-28 04:41:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-28 04:41:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 263 states have (on average 1.4600760456273765) internal successors, (384), 354 states have internal predecessors, (384), 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) [2024-11-28 04:41:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 399 transitions. [2024-11-28 04:41:17,104 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 399 transitions. Word has length 85 [2024-11-28 04:41:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:17,104 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 399 transitions. [2024-11-28 04:41:17,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 50 states have internal predecessors, (110), 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) [2024-11-28 04:41:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 399 transitions. [2024-11-28 04:41:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-28 04:41:17,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:17,106 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:17,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 04:41:17,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-28 04:41:17,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:41:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -898687055, now seen corresponding path program 1 times [2024-11-28 04:41:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049938334] [2024-11-28 04:41:17,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:41:17,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049938334] [2024-11-28 04:41:17,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049938334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:17,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85482965] [2024-11-28 04:41:17,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:41:17,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:17,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:17,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:17,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 04:41:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:41:18,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:41:18,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:41:18,458 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:41:18,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:41:18,602 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:41:18,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85482965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:41:18,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:41:18,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-28 04:41:18,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131263884] [2024-11-28 04:41:18,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:41:18,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:41:18,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:41:18,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:41:18,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:41:18,604 INFO L87 Difference]: Start difference. First operand 364 states and 399 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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) [2024-11-28 04:41:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:41:18,704 INFO L93 Difference]: Finished difference Result 417 states and 455 transitions. [2024-11-28 04:41:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:41:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2024-11-28 04:41:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:41:18,706 INFO L225 Difference]: With dead ends: 417 [2024-11-28 04:41:18,706 INFO L226 Difference]: Without dead ends: 417 [2024-11-28 04:41:18,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:41:18,707 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 22 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:41:18,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1121 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:41:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-11-28 04:41:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 408. [2024-11-28 04:41:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 307 states have (on average 1.4332247557003257) internal successors, (440), 398 states have internal predecessors, (440), 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) [2024-11-28 04:41:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 455 transitions. [2024-11-28 04:41:18,716 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 455 transitions. Word has length 96 [2024-11-28 04:41:18,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:41:18,716 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 455 transitions. [2024-11-28 04:41:18,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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) [2024-11-28 04:41:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 455 transitions. [2024-11-28 04:41:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 04:41:18,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:41:18,718 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:41:18,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 04:41:18,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:41:18,919 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [execvpErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, execvpErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 174 more)] === [2024-11-28 04:41:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:41:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash -171243266, now seen corresponding path program 4 times [2024-11-28 04:41:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:41:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354911158] [2024-11-28 04:41:18,919 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:41:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:41:19,257 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 04:41:19,257 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:41:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:41:22,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:41:22,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354911158] [2024-11-28 04:41:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354911158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:41:22,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562343523] [2024-11-28 04:41:22,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 04:41:22,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:41:22,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:41:22,847 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:41:22,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e691316-f9be-4d96-9573-850b8815dc89/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process