./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/sync-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_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/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_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/sync-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/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_f001ee61-67d9-4353-b850-0c4f3703aace/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 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:08:15,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:08:16,101 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-27 20:08:16,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:08:16,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:08:16,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:08:16,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:08:16,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:08:16,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:08:16,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:08:16,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:08:16,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:08:16,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:08:16,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:08:16,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:08:16,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:08:16,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:08:16,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:08:16,176 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 20:08:16,176 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 20:08:16,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 20:08:16,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:08:16,177 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:16,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:16,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:16,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:16,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:16,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:08:16,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:08:16,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:08:16,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:08:16,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:08:16,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:08:16,180 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_f001ee61-67d9-4353-b850-0c4f3703aace/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 -> 3e9a9e28ec707ec387b70e5fb29d6b347c7ed8919bb4c21e62aca8b2b5a70bf5 [2024-11-27 20:08:16,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:08:16,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:08:16,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:08:16,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:08:16,569 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:08:16,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/sync-2.i [2024-11-27 20:08:20,195 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/data/e45722483/65661ba29152448f849072066955c482/FLAG0f0da052c [2024-11-27 20:08:20,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:08:20,820 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/sv-benchmarks/c/busybox-1.22.0/sync-2.i [2024-11-27 20:08:20,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/data/e45722483/65661ba29152448f849072066955c482/FLAG0f0da052c [2024-11-27 20:08:20,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/data/e45722483/65661ba29152448f849072066955c482 [2024-11-27 20:08:20,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:08:20,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:08:20,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:20,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:08:20,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:08:20,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:20" (1/1) ... [2024-11-27 20:08:20,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b33672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:20, skipping insertion in model container [2024-11-27 20:08:20,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:08:20" (1/1) ... [2024-11-27 20:08:21,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:08:22,191 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-27 20:08:22,195 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-27 20:08:22,199 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-27 20:08:22,204 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-27 20:08:22,205 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-27 20:08:22,206 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-27 20:08:22,211 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-27 20:08:22,215 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-27 20:08:22,217 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-27 20:08:22,222 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-27 20:08:22,224 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-27 20:08:22,226 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-27 20:08:22,234 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-27 20:08:22,235 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-27 20:08:22,244 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-27 20:08:22,260 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-27 20:08:22,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:22,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:08:22,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:08:22,715 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-27 20:08:22,725 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:08:22,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22 WrapperNode [2024-11-27 20:08:22,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:08:22,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:22,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:08:22,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:08:22,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,844 INFO L138 Inliner]: procedures = 540, calls = 474, calls flagged for inlining = 16, calls inlined = 15, statements flattened = 712 [2024-11-27 20:08:22,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:08:22,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:08:22,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:08:22,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:08:22,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,886 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-27 20:08:22,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:22,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:23,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:08:23,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:08:23,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:08:23,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:08:23,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (1/1) ... [2024-11-27 20:08:23,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:08:23,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:23,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:08:23,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:08:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 20:08:23,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:08:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:08:23,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-27 20:08:23,100 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-27 20:08:23,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-27 20:08:23,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 20:08:23,621 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:08:23,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:08:25,087 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-11-27 20:08:25,087 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:08:25,107 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:08:25,107 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-27 20:08:25,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:25 BoogieIcfgContainer [2024-11-27 20:08:25,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:08:25,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:08:25,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:08:25,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:08:25,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:08:20" (1/3) ... [2024-11-27 20:08:25,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568d59af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:25, skipping insertion in model container [2024-11-27 20:08:25,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:08:22" (2/3) ... [2024-11-27 20:08:25,118 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@568d59af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:08:25, skipping insertion in model container [2024-11-27 20:08:25,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:08:25" (3/3) ... [2024-11-27 20:08:25,119 INFO L128 eAbstractionObserver]: Analyzing ICFG sync-2.i [2024-11-27 20:08:25,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:08:25,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync-2.i that has 3 procedures, 271 locations, 1 initial locations, 11 loop locations, and 107 error locations. [2024-11-27 20:08:25,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:08:25,210 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;@360456e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:08:25,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2024-11-27 20:08:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 156 states have (on average 1.9102564102564104) internal successors, (298), 263 states have internal predecessors, (298), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 20:08:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:08:25,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:25,227 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:08:25,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash 62626, now seen corresponding path program 1 times [2024-11-27 20:08:25,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:25,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566503510] [2024-11-27 20:08:25,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:26,309 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-27 20:08:26,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:26,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566503510] [2024-11-27 20:08:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566503510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477167459] [2024-11-27 20:08:26,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:26,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:26,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:26,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:26,362 INFO L87 Difference]: Start difference. First operand has 271 states, 156 states have (on average 1.9102564102564104) internal successors, (298), 263 states have internal predecessors, (298), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-27 20:08:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:26,628 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2024-11-27 20:08:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:26,632 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-27 20:08:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:26,641 INFO L225 Difference]: With dead ends: 129 [2024-11-27 20:08:26,641 INFO L226 Difference]: Without dead ends: 127 [2024-11-27 20:08:26,644 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-27 20:08:26,647 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 77 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:26,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-27 20:08:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2024-11-27 20:08:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 104 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-27 20:08:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-27 20:08:26,707 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 3 [2024-11-27 20:08:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:26,707 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-27 20:08:26,708 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-27 20:08:26,708 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-27 20:08:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-27 20:08:26,708 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:26,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-27 20:08:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:08:26,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:26,710 INFO L85 PathProgramCache]: Analyzing trace with hash 62627, now seen corresponding path program 1 times [2024-11-27 20:08:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511033098] [2024-11-27 20:08:26,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:27,279 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-27 20:08:27,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511033098] [2024-11-27 20:08:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511033098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:27,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820559247] [2024-11-27 20:08:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:27,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:27,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:27,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:27,286 INFO L87 Difference]: Start difference. First operand 107 states and 112 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-27 20:08:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:27,471 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-11-27 20:08:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:27,473 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-27 20:08:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:27,474 INFO L225 Difference]: With dead ends: 106 [2024-11-27 20:08:27,474 INFO L226 Difference]: Without dead ends: 106 [2024-11-27 20:08:27,474 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-27 20:08:27,475 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:27,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-27 20:08:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-27 20:08:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 65 states have (on average 1.676923076923077) internal successors, (109), 103 states have internal predecessors, (109), 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-27 20:08:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-27 20:08:27,498 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 3 [2024-11-27 20:08:27,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:27,498 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-27 20:08:27,498 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-27 20:08:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-27 20:08:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 20:08:27,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:27,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:27,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:08:27,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:27,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:27,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2002134442, now seen corresponding path program 1 times [2024-11-27 20:08:27,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:27,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214134011] [2024-11-27 20:08:27,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:27,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:28,111 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-27 20:08:28,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:28,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214134011] [2024-11-27 20:08:28,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214134011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:28,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:28,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:08:28,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020205644] [2024-11-27 20:08:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:28,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:08:28,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:28,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:08:28,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:08:28,115 INFO L87 Difference]: Start difference. First operand 106 states and 111 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-27 20:08:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:28,321 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2024-11-27 20:08:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:08:28,323 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-27 20:08:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:28,324 INFO L225 Difference]: With dead ends: 110 [2024-11-27 20:08:28,325 INFO L226 Difference]: Without dead ends: 110 [2024-11-27 20:08:28,325 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-27 20:08:28,326 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 13 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 170 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.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:28,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 170 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-27 20:08:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-27 20:08:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 106 states have internal predecessors, (112), 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-27 20:08:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-27 20:08:28,344 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 7 [2024-11-27 20:08:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-27 20:08:28,345 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-27 20:08:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-27 20:08:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 20:08:28,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:28,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:28,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:08:28,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -283912093, now seen corresponding path program 1 times [2024-11-27 20:08:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840025622] [2024-11-27 20:08:28,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:28,962 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-27 20:08:28,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840025622] [2024-11-27 20:08:28,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840025622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:28,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522014561] [2024-11-27 20:08:28,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:28,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:28,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:08:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:29,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-27 20:08:29,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:29,648 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-27 20:08:29,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:29,855 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-27 20:08:29,881 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-27 20:08:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522014561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:29,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-27 20:08:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170871242] [2024-11-27 20:08:29,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:29,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-27 20:08:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:29,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-27 20:08:29,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:08:29,884 INFO L87 Difference]: Start difference. First operand 109 states and 114 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-27 20:08:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:30,416 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2024-11-27 20:08:30,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:08:30,417 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-27 20:08:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:30,418 INFO L225 Difference]: With dead ends: 114 [2024-11-27 20:08:30,420 INFO L226 Difference]: Without dead ends: 114 [2024-11-27 20:08:30,421 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-27 20:08:30,422 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 190 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:30,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 620 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:08:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-27 20:08:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-27 20:08:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 111 states have internal predecessors, (117), 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-27 20:08:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2024-11-27 20:08:30,440 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 11 [2024-11-27 20:08:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:30,440 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2024-11-27 20:08:30,440 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-27 20:08:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2024-11-27 20:08:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 20:08:30,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:30,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:30,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 20:08:30,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:30,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:30,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:30,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1010268374, now seen corresponding path program 1 times [2024-11-27 20:08:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:30,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942365069] [2024-11-27 20:08:30,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:30,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:31,063 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-27 20:08:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:31,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942365069] [2024-11-27 20:08:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942365069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:31,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994552037] [2024-11-27 20:08:31,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:31,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:31,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:31,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:31,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:08:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:31,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:08:31,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:31,500 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-27 20:08:31,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:31,604 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-27 20:08:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994552037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:31,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-27 20:08:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397826608] [2024-11-27 20:08:31,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:31,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:08:31,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:31,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:08:31,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:08:31,609 INFO L87 Difference]: Start difference. First operand 114 states and 119 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-27 20:08:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:31,694 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2024-11-27 20:08:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:08:31,694 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-27 20:08:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:31,695 INFO L225 Difference]: With dead ends: 134 [2024-11-27 20:08:31,695 INFO L226 Difference]: Without dead ends: 134 [2024-11-27 20:08:31,696 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-27 20:08:31,696 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 6 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:31,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 421 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-27 20:08:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-27 20:08:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 131 states have internal predecessors, (137), 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-27 20:08:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2024-11-27 20:08:31,705 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 19 [2024-11-27 20:08:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:31,705 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2024-11-27 20:08:31,705 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-27 20:08:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2024-11-27 20:08:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 20:08:31,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:31,710 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:31,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 20:08:31,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:31,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:31,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1745438195, now seen corresponding path program 2 times [2024-11-27 20:08:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487315286] [2024-11-27 20:08:31,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:08:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:31,999 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:08:31,999 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:08:32,365 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-27 20:08:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487315286] [2024-11-27 20:08:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487315286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:32,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:32,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658941980] [2024-11-27 20:08:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:08:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:32,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:08:32,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:08:32,367 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-27 20:08:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:32,518 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2024-11-27 20:08:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-27 20:08:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:32,520 INFO L225 Difference]: With dead ends: 153 [2024-11-27 20:08:32,522 INFO L226 Difference]: Without dead ends: 153 [2024-11-27 20:08:32,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-27 20:08:32,524 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 144 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:32,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 102 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:32,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-27 20:08:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2024-11-27 20:08:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 1.446808510638298) internal successors, (136), 130 states have internal predecessors, (136), 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-27 20:08:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2024-11-27 20:08:32,533 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 39 [2024-11-27 20:08:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:32,538 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2024-11-27 20:08:32,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-27 20:08:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2024-11-27 20:08:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-27 20:08:32,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:32,539 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:32,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:08:32,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:32,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1745438196, now seen corresponding path program 1 times [2024-11-27 20:08:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728556997] [2024-11-27 20:08:32,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:32,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:33,184 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-27 20:08:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728556997] [2024-11-27 20:08:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728556997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546200845] [2024-11-27 20:08:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:33,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:33,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:33,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:33,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 20:08:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:33,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 20:08:33,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:33,747 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-27 20:08:33,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:33,967 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-27 20:08:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546200845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:33,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-27 20:08:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4336076] [2024-11-27 20:08:33,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:08:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:33,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:08:33,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:08:33,969 INFO L87 Difference]: Start difference. First operand 133 states and 138 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-27 20:08:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:34,060 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2024-11-27 20:08:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:08:34,061 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-27 20:08:34,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:34,062 INFO L225 Difference]: With dead ends: 141 [2024-11-27 20:08:34,062 INFO L226 Difference]: Without dead ends: 141 [2024-11-27 20:08:34,063 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-27 20:08:34,063 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:34,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 217 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-27 20:08:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-27 20:08:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.411764705882353) internal successors, (144), 138 states have internal predecessors, (144), 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-27 20:08:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2024-11-27 20:08:34,072 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 39 [2024-11-27 20:08:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:34,072 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2024-11-27 20:08:34,072 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-27 20:08:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2024-11-27 20:08:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-27 20:08:34,073 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:34,074 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:08:34,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 20:08:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:34,275 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1610981658, now seen corresponding path program 2 times [2024-11-27 20:08:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789773067] [2024-11-27 20:08:34,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:08:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:34,356 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:08:34,356 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:08:34,751 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-27 20:08:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789773067] [2024-11-27 20:08:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789773067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:08:34,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957984994] [2024-11-27 20:08:34,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:34,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:08:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:34,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:08:34,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:08:34,753 INFO L87 Difference]: Start difference. First operand 141 states and 146 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-27 20:08:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:34,982 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2024-11-27 20:08:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:08:34,982 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-27 20:08:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:34,984 INFO L225 Difference]: With dead ends: 160 [2024-11-27 20:08:34,986 INFO L226 Difference]: Without dead ends: 160 [2024-11-27 20:08:34,987 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-27 20:08:34,988 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 231 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:34,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 89 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-27 20:08:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2024-11-27 20:08:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 137 states have internal predecessors, (143), 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-27 20:08:34,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2024-11-27 20:08:35,003 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 47 [2024-11-27 20:08:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:35,003 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2024-11-27 20:08:35,003 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-27 20:08:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2024-11-27 20:08:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 20:08:35,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:35,005 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-27 20:08:35,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:08:35,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:35,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:35,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1671894618, now seen corresponding path program 1 times [2024-11-27 20:08:35,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:35,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040330872] [2024-11-27 20:08:35,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:35,538 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-27 20:08:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040330872] [2024-11-27 20:08:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040330872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:35,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639533485] [2024-11-27 20:08:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:35,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:35,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:35,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:35,541 INFO L87 Difference]: Start difference. First operand 140 states and 145 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-27 20:08:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:35,686 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2024-11-27 20:08:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:35,687 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-27 20:08:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:35,689 INFO L225 Difference]: With dead ends: 155 [2024-11-27 20:08:35,690 INFO L226 Difference]: Without dead ends: 155 [2024-11-27 20:08:35,690 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-27 20:08:35,691 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 55 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:35,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 113 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-27 20:08:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2024-11-27 20:08:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 132 states have internal predecessors, (138), 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-27 20:08:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2024-11-27 20:08:35,703 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 55 [2024-11-27 20:08:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2024-11-27 20:08:35,703 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-27 20:08:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2024-11-27 20:08:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 20:08:35,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:35,709 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-27 20:08:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:08:35,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1671894619, now seen corresponding path program 1 times [2024-11-27 20:08:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697208897] [2024-11-27 20:08:35,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:37,129 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-27 20:08:37,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:37,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697208897] [2024-11-27 20:08:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697208897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:37,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:08:37,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275921376] [2024-11-27 20:08:37,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:37,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:08:37,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:37,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:08:37,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:08:37,132 INFO L87 Difference]: Start difference. First operand 135 states and 140 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-27 20:08:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:37,348 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2024-11-27 20:08:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:08:37,350 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-27 20:08:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:37,352 INFO L225 Difference]: With dead ends: 155 [2024-11-27 20:08:37,352 INFO L226 Difference]: Without dead ends: 155 [2024-11-27 20:08:37,352 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-27 20:08:37,357 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 86 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:37,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 382 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-27 20:08:37,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 134. [2024-11-27 20:08:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 131 states have internal predecessors, (137), 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-27 20:08:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2024-11-27 20:08:37,368 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 55 [2024-11-27 20:08:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:37,368 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2024-11-27 20:08:37,368 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-27 20:08:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2024-11-27 20:08:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 20:08:37,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:37,374 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-27 20:08:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:08:37,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:37,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1932644962, now seen corresponding path program 1 times [2024-11-27 20:08:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417756263] [2024-11-27 20:08:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,085 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-27 20:08:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:38,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417756263] [2024-11-27 20:08:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417756263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:38,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:38,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:08:38,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389995822] [2024-11-27 20:08:38,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:38,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:08:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:38,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:08:38,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:08:38,089 INFO L87 Difference]: Start difference. First operand 134 states and 139 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-27 20:08:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:38,369 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2024-11-27 20:08:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:08:38,370 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-27 20:08:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:38,371 INFO L225 Difference]: With dead ends: 174 [2024-11-27 20:08:38,371 INFO L226 Difference]: Without dead ends: 174 [2024-11-27 20:08:38,371 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-27 20:08:38,372 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 164 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:38,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:08:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-27 20:08:38,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2024-11-27 20:08:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 117 states have (on average 1.358974358974359) internal successors, (159), 145 states have internal predecessors, (159), 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-27 20:08:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2024-11-27 20:08:38,383 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 59 [2024-11-27 20:08:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:38,384 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2024-11-27 20:08:38,384 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-27 20:08:38,384 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2024-11-27 20:08:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 20:08:38,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:38,387 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-27 20:08:38,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:08:38,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1932648259, now seen corresponding path program 1 times [2024-11-27 20:08:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:38,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213565946] [2024-11-27 20:08:38,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:38,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:38,737 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-27 20:08:38,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:38,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213565946] [2024-11-27 20:08:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213565946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:08:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127607932] [2024-11-27 20:08:38,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:08:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:38,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:08:38,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:08:38,740 INFO L87 Difference]: Start difference. First operand 148 states and 161 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-27 20:08:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:38,925 INFO L93 Difference]: Finished difference Result 167 states and 181 transitions. [2024-11-27 20:08:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:08:38,925 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-27 20:08:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:38,926 INFO L225 Difference]: With dead ends: 167 [2024-11-27 20:08:38,927 INFO L226 Difference]: Without dead ends: 167 [2024-11-27 20:08:38,927 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-27 20:08:38,927 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:38,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 169 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-27 20:08:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 147. [2024-11-27 20:08:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 144 states have internal predecessors, (158), 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-27 20:08:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 160 transitions. [2024-11-27 20:08:38,934 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 160 transitions. Word has length 59 [2024-11-27 20:08:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:38,934 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 160 transitions. [2024-11-27 20:08:38,934 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-27 20:08:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 160 transitions. [2024-11-27 20:08:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-27 20:08:38,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:38,936 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-27 20:08:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:08:38,936 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:38,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1932648260, now seen corresponding path program 1 times [2024-11-27 20:08:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936282435] [2024-11-27 20:08:38,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:38,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:39,446 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-27 20:08:39,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936282435] [2024-11-27 20:08:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936282435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:39,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:39,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:08:39,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008319716] [2024-11-27 20:08:39,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:39,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:08:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:39,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:08:39,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:08:39,448 INFO L87 Difference]: Start difference. First operand 147 states and 160 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-27 20:08:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:39,572 INFO L93 Difference]: Finished difference Result 153 states and 160 transitions. [2024-11-27 20:08:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:08:39,573 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-27 20:08:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:39,574 INFO L225 Difference]: With dead ends: 153 [2024-11-27 20:08:39,575 INFO L226 Difference]: Without dead ends: 153 [2024-11-27 20:08:39,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:08:39,576 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 83 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:39,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 356 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-27 20:08:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2024-11-27 20:08:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 144 states have internal predecessors, (157), 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-27 20:08:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2024-11-27 20:08:39,590 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 59 [2024-11-27 20:08:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:39,591 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2024-11-27 20:08:39,591 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-27 20:08:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2024-11-27 20:08:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 20:08:39,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:39,593 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-27 20:08:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:08:39,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:39,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:39,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1389480949, now seen corresponding path program 1 times [2024-11-27 20:08:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:39,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432169777] [2024-11-27 20:08:39,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:40,046 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-27 20:08:40,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:40,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432169777] [2024-11-27 20:08:40,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432169777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:40,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:40,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:08:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807673774] [2024-11-27 20:08:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:40,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:08:40,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:40,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:08:40,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:40,049 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-27 20:08:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:40,176 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2024-11-27 20:08:40,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:08:40,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-27 20:08:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:40,178 INFO L225 Difference]: With dead ends: 156 [2024-11-27 20:08:40,181 INFO L226 Difference]: Without dead ends: 156 [2024-11-27 20:08:40,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:08:40,182 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:40,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 109 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:08:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-27 20:08:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2024-11-27 20:08:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 152 states have internal predecessors, (168), 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-27 20:08:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2024-11-27 20:08:40,188 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 62 [2024-11-27 20:08:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:40,188 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2024-11-27 20:08:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 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-27 20:08:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2024-11-27 20:08:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-27 20:08:40,189 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:40,189 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-27 20:08:40,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:08:40,190 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:40,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1389480950, now seen corresponding path program 1 times [2024-11-27 20:08:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56285296] [2024-11-27 20:08:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:41,450 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-27 20:08:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56285296] [2024-11-27 20:08:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56285296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:08:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726464543] [2024-11-27 20:08:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:41,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:08:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:41,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:08:41,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:08:41,453 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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-27 20:08:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:41,915 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2024-11-27 20:08:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:08:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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-27 20:08:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:41,917 INFO L225 Difference]: With dead ends: 160 [2024-11-27 20:08:41,918 INFO L226 Difference]: Without dead ends: 160 [2024-11-27 20:08:41,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:08:41,918 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 38 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:41,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 230 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:08:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-27 20:08:41,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2024-11-27 20:08:41,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 152 states have internal predecessors, (167), 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-27 20:08:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 169 transitions. [2024-11-27 20:08:41,939 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 169 transitions. Word has length 62 [2024-11-27 20:08:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:41,939 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 169 transitions. [2024-11-27 20:08:41,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 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-27 20:08:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2024-11-27 20:08:41,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 20:08:41,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:41,940 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-27 20:08:41,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:08:41,941 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash -867789560, now seen corresponding path program 1 times [2024-11-27 20:08:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489228819] [2024-11-27 20:08:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:42,863 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-27 20:08:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489228819] [2024-11-27 20:08:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489228819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:42,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:08:42,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371464864] [2024-11-27 20:08:42,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:08:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:42,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:08:42,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:08:42,867 INFO L87 Difference]: Start difference. First operand 155 states and 169 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-27 20:08:43,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:43,166 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2024-11-27 20:08:43,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:08:43,166 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-27 20:08:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:43,168 INFO L225 Difference]: With dead ends: 154 [2024-11-27 20:08:43,168 INFO L226 Difference]: Without dead ends: 154 [2024-11-27 20:08:43,169 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-27 20:08:43,169 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:43,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 286 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:08:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-27 20:08:43,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-27 20:08:43,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 151 states have internal predecessors, (165), 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-27 20:08:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2024-11-27 20:08:43,180 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 65 [2024-11-27 20:08:43,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:43,180 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2024-11-27 20:08:43,180 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-27 20:08:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2024-11-27 20:08:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 20:08:43,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:43,182 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-27 20:08:43,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:08:43,182 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -867789559, now seen corresponding path program 1 times [2024-11-27 20:08:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256590607] [2024-11-27 20:08:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:44,337 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-27 20:08:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:44,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256590607] [2024-11-27 20:08:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256590607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:44,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:08:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081806294] [2024-11-27 20:08:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:44,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:08:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:44,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:08:44,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:08:44,340 INFO L87 Difference]: Start difference. First operand 154 states and 167 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-27 20:08:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:44,588 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2024-11-27 20:08:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:08:44,589 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-27 20:08:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:44,590 INFO L225 Difference]: With dead ends: 153 [2024-11-27 20:08:44,591 INFO L226 Difference]: Without dead ends: 153 [2024-11-27 20:08:44,591 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-27 20:08:44,592 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 53 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:44,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 259 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:08:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-27 20:08:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-27 20:08:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 150 states have internal predecessors, (163), 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-27 20:08:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2024-11-27 20:08:44,598 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 65 [2024-11-27 20:08:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:44,599 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2024-11-27 20:08:44,599 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-27 20:08:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2024-11-27 20:08:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 20:08:44,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:44,600 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-27 20:08:44,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:08:44,601 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:44,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:44,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1122677086, now seen corresponding path program 1 times [2024-11-27 20:08:44,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017468785] [2024-11-27 20:08:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:45,550 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-27 20:08:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017468785] [2024-11-27 20:08:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017468785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:08:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786348969] [2024-11-27 20:08:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:45,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:08:45,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:45,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:08:45,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:08:45,552 INFO L87 Difference]: Start difference. First operand 153 states and 165 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-27 20:08:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:46,068 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2024-11-27 20:08:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:08:46,069 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-27 20:08:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:46,070 INFO L225 Difference]: With dead ends: 170 [2024-11-27 20:08:46,070 INFO L226 Difference]: Without dead ends: 170 [2024-11-27 20:08:46,070 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-27 20:08:46,071 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 125 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:46,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 403 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:08:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-27 20:08:46,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-11-27 20:08:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.3134328358208955) internal successors, (176), 158 states have internal predecessors, (176), 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-27 20:08:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 178 transitions. [2024-11-27 20:08:46,080 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 178 transitions. Word has length 70 [2024-11-27 20:08:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:46,081 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 178 transitions. [2024-11-27 20:08:46,081 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-27 20:08:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2024-11-27 20:08:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-27 20:08:46,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:46,082 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-27 20:08:46,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:08:46,083 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:46,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:46,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1122677087, now seen corresponding path program 1 times [2024-11-27 20:08:46,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:46,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43951763] [2024-11-27 20:08:46,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:46,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:47,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-27 20:08:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:47,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43951763] [2024-11-27 20:08:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43951763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:08:47,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:08:47,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:08:47,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049249264] [2024-11-27 20:08:47,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:08:47,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:08:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:47,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:08:47,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:08:47,794 INFO L87 Difference]: Start difference. First operand 161 states and 178 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-27 20:08:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:48,407 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2024-11-27 20:08:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:08:48,408 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-27 20:08:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:48,410 INFO L225 Difference]: With dead ends: 168 [2024-11-27 20:08:48,410 INFO L226 Difference]: Without dead ends: 168 [2024-11-27 20:08:48,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:08:48,412 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:48,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 387 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:08:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-27 20:08:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 161. [2024-11-27 20:08:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 134 states have (on average 1.2835820895522387) internal successors, (172), 158 states have internal predecessors, (172), 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-27 20:08:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2024-11-27 20:08:48,423 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 70 [2024-11-27 20:08:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:48,424 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2024-11-27 20:08:48,424 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-27 20:08:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2024-11-27 20:08:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 20:08:48,425 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:48,425 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-27 20:08:48,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:08:48,426 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:48,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1373083047, now seen corresponding path program 1 times [2024-11-27 20:08:48,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:48,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265554499] [2024-11-27 20:08:48,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:48,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:49,575 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-27 20:08:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265554499] [2024-11-27 20:08:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265554499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964010947] [2024-11-27 20:08:49,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:49,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:49,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 20:08:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:50,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-27 20:08:50,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:50,138 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-27 20:08:50,186 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:08:50,187 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-27 20:08:50,215 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-27 20:08:50,255 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-27 20:08:50,333 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:08:50,333 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-27 20:08:50,469 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:08:50,470 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-27 20:08:50,506 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-27 20:08:50,514 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-27 20:08:50,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:50,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_1552) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2024-11-27 20:08:50,583 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1552) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2024-11-27 20:08:50,632 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2024-11-27 20:08:50,633 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 37 treesize of output 36 [2024-11-27 20:08:50,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem143#1.base| (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_1551))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1552)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) is different from false [2024-11-27 20:08:50,672 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1551))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1552)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2)))) is different from false [2024-11-27 20:08:50,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1552 (Array Int Int)) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1550)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1551))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1552)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))) is different from false [2024-11-27 20:08:50,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:50,727 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-27 20:08:50,738 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 2674 treesize of output 2026 [2024-11-27 20:08:50,762 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 146 treesize of output 110 [2024-11-27 20:08:50,767 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 110 treesize of output 98 [2024-11-27 20:08:50,776 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 33 [2024-11-27 20:08:50,944 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 20:08:50,944 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-27 20:08:50,966 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-27 20:08:50,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964010947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:50,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:50,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-27 20:08:50,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185268848] [2024-11-27 20:08:50,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:50,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 20:08:50,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:50,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 20:08:50,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=172, Unknown=5, NotChecked=150, Total=380 [2024-11-27 20:08:50,969 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 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-27 20:08:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:08:51,625 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2024-11-27 20:08:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:08:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 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-27 20:08:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:08:51,627 INFO L225 Difference]: With dead ends: 167 [2024-11-27 20:08:51,627 INFO L226 Difference]: Without dead ends: 167 [2024-11-27 20:08:51,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=295, Unknown=5, NotChecked=200, Total=600 [2024-11-27 20:08:51,628 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 122 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:08:51,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 478 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 472 Unchecked, 0.4s Time] [2024-11-27 20:08:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-27 20:08:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-27 20:08:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 157 states have internal predecessors, (170), 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-27 20:08:51,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2024-11-27 20:08:51,635 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 75 [2024-11-27 20:08:51,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:08:51,635 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2024-11-27 20:08:51,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.263157894736842) internal successors, (62), 20 states have internal predecessors, (62), 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-27 20:08:51,636 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2024-11-27 20:08:51,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 20:08:51,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:08:51,637 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-27 20:08:51,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 20:08:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:51,841 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:08:51,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:08:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1373083046, now seen corresponding path program 1 times [2024-11-27 20:08:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:08:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046594313] [2024-11-27 20:08:51,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:08:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:54,394 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-27 20:08:54,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:08:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046594313] [2024-11-27 20:08:54,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046594313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:08:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685449266] [2024-11-27 20:08:54,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:08:54,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:08:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:08:54,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:08:54,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 20:08:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:08:54,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-27 20:08:54,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:08:54,972 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-27 20:08:54,973 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-27 20:08:55,151 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-27 20:08:55,152 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-27 20:08:55,237 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-27 20:08:55,247 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-27 20:08:55,391 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-27 20:08:55,403 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-27 20:08:55,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-27 20:08:55,604 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 95 treesize of output 49 [2024-11-27 20:08:55,616 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-27 20:08:56,007 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:08:56,008 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-27 20:08:56,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 47 [2024-11-27 20:08:56,272 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-27 20:08:56,280 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 40 treesize of output 16 [2024-11-27 20:08:56,355 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-27 20:08:56,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:08:57,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:57,159 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 165 treesize of output 169 [2024-11-27 20:08:57,382 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~mem143#1.offset| 10)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (or (forall ((v_ArrVal_1782 Int) (v_ArrVal_1783 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem143#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| (store .cse2 .cse3 v_ArrVal_1782)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1783)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (forall ((v_ArrVal_1781 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_1781) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_1782 Int) (v_ArrVal_1784 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_1781))) (or (< (select (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| (store .cse2 .cse3 v_ArrVal_1782)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1784) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse3) (< (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0)))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_prenex_3))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< .cse5 0) (< .cse5 (+ 2 (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| (store .cse2 .cse3 v_prenex_1)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-27 20:08:57,504 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| .cse0) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse3 v_prenex_3))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (< .cse1 (+ 2 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10) v_prenex_1)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (< .cse1 0))))))) (forall ((|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| .cse0) (forall ((v_ArrVal_1782 Int) (v_ArrVal_1784 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1781))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 0) (let ((.cse7 (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10))) (< (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 .cse7 v_ArrVal_1782)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1784) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse7))))))) (or (forall ((v_ArrVal_1782 Int) (v_ArrVal_1783 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| .cse0) (= (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10) v_ArrVal_1782)))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1783)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse3))) (forall ((v_ArrVal_1781 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1781) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 0))))))) is different from false [2024-11-27 20:08:57,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1778 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1778))) (or (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1779))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse3 (store .cse0 .cse5 v_prenex_3))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (or (< .cse2 0) (< .cse2 (+ (select (select (store .cse3 (select (select (store .cse4 .cse5 (store (select .cse4 .cse5) (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10) v_prenex_1)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_prenex_2) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2))))))))))) (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1778 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1778))) (or (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (forall ((v_ArrVal_1782 Int) (v_ArrVal_1784 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1779))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (let ((.cse7 (store .cse6 .cse9 v_ArrVal_1781))) (or (< (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0) (let ((.cse10 (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10))) (< (select (select (store .cse7 (select (select (store .cse8 .cse9 (store (select .cse8 .cse9) .cse10 v_ArrVal_1782)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1784) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse10)))))))))) (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1778 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1779))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1778))) (or (forall ((v_ArrVal_1781 (Array Int Int))) (< (select (select (store .cse11 .cse12 v_ArrVal_1781) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1782 Int) (v_ArrVal_1783 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem143#1.offset_12| Int)) (or (= (select (select (let ((.cse13 (store .cse14 .cse12 (store (select .cse14 .cse12) (+ |v_ULTIMATE.start_main_#t~mem143#1.offset_12| 10) v_ArrVal_1782)))) (store .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1783)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse12) (< |v_ULTIMATE.start_main_#t~mem143#1.offset_12| (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))))))) is different from false [2024-11-27 20:08:57,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:57,979 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 279 treesize of output 243 [2024-11-27 20:08:57,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:08:57,994 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 217 treesize of output 145 [2024-11-27 20:08:58,091 INFO L349 Elim1Store]: treesize reduction 14, result has 62.2 percent of original size [2024-11-27 20:08:58,092 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 2166 treesize of output 2042 [2024-11-27 20:08:58,163 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 21018 treesize of output 19474 [2024-11-27 20:08:58,248 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 317 treesize of output 281 [2024-11-27 20:08:58,266 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 202 treesize of output 178 [2024-11-27 20:08:58,285 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 276 treesize of output 222 [2024-11-27 20:08:58,308 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 46 treesize of output 34 [2024-11-27 20:08:58,516 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 46 treesize of output 28 [2024-11-27 20:08:58,539 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-27 20:08:58,540 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 230 treesize of output 1 [2024-11-27 20:08:58,548 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-27 20:08:58,854 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-27 20:08:58,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685449266] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:08:58,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:08:58,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2024-11-27 20:08:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988807661] [2024-11-27 20:08:58,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:08:58,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-27 20:08:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:08:58,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-27 20:08:58,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1115, Unknown=3, NotChecked=210, Total=1482 [2024-11-27 20:08:58,861 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 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-27 20:09:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:04,868 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2024-11-27 20:09:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-27 20:09:04,868 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 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-27 20:09:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:04,870 INFO L225 Difference]: With dead ends: 189 [2024-11-27 20:09:04,870 INFO L226 Difference]: Without dead ends: 189 [2024-11-27 20:09:04,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=589, Invalid=2938, Unknown=25, NotChecked=354, Total=3906 [2024-11-27 20:09:04,873 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 340 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 28 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:04,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1013 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 895 Invalid, 37 Unknown, 423 Unchecked, 2.0s Time] [2024-11-27 20:09:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-27 20:09:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 180. [2024-11-27 20:09:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 154 states have (on average 1.2532467532467533) internal successors, (193), 177 states have internal predecessors, (193), 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-27 20:09:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 195 transitions. [2024-11-27 20:09:04,881 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 195 transitions. Word has length 75 [2024-11-27 20:09:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:04,881 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 195 transitions. [2024-11-27 20:09:04,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 states have internal predecessors, (81), 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-27 20:09:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 195 transitions. [2024-11-27 20:09:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-27 20:09:04,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:04,882 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 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-27 20:09:04,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:05,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-27 20:09:05,083 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:09:05,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash 260162988, now seen corresponding path program 1 times [2024-11-27 20:09:05,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279743221] [2024-11-27 20:09:05,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:09:05,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:05,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279743221] [2024-11-27 20:09:05,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279743221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:05,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441357420] [2024-11-27 20:09:05,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:05,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:05,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:05,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 20:09:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:05,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-27 20:09:05,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:09:06,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:09:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441357420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:09:06,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:09:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-27 20:09:06,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879151052] [2024-11-27 20:09:06,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:09:06,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:09:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:06,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:09:06,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:09:06,123 INFO L87 Difference]: Start difference. First operand 180 states and 195 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-27 20:09:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:06,207 INFO L93 Difference]: Finished difference Result 231 states and 250 transitions. [2024-11-27 20:09:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:09:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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 86 [2024-11-27 20:09:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:06,210 INFO L225 Difference]: With dead ends: 231 [2024-11-27 20:09:06,210 INFO L226 Difference]: Without dead ends: 231 [2024-11-27 20:09:06,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 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-27 20:09:06,213 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 23 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:06,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 538 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:09:06,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-27 20:09:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2024-11-27 20:09:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 198 states have (on average 1.2525252525252526) internal successors, (248), 221 states have internal predecessors, (248), 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-27 20:09:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 250 transitions. [2024-11-27 20:09:06,227 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 250 transitions. Word has length 86 [2024-11-27 20:09:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:06,229 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 250 transitions. [2024-11-27 20:09:06,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 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-27 20:09:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 250 transitions. [2024-11-27 20:09:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 20:09:06,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:06,230 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 5, 5, 5, 4, 4, 1, 1, 1, 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-27 20:09:06,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 20:09:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-27 20:09:06,431 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:09:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 492888863, now seen corresponding path program 2 times [2024-11-27 20:09:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745783926] [2024-11-27 20:09:06,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:09:06,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:06,797 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:09:06,797 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:09:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:09:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745783926] [2024-11-27 20:09:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745783926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:09:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061661246] [2024-11-27 20:09:10,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:09:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:09:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:10,662 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:09:10,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 20:09:11,258 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 20:09:11,258 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:09:11,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-27 20:09:11,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:09:11,280 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-27 20:09:11,315 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:09:11,315 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-27 20:09:11,328 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-27 20:09:11,347 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-27 20:09:11,352 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-27 20:09:11,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 34 treesize of output 27 [2024-11-27 20:09:11,407 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-27 20:09:11,533 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:09:11,533 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-27 20:09:11,545 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-27 20:09:11,637 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:09:11,637 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-27 20:09:11,649 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-27 20:09:11,867 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:09:11,868 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-27 20:09:11,884 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-27 20:09:12,072 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:09:12,072 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-27 20:09:12,083 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-27 20:09:12,246 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:09:12,246 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-27 20:09:12,257 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-27 20:09:12,348 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-27 20:09:12,355 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-27 20:09:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:09:12,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:09:12,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2304 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:09:12,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2304 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-27 20:09:12,584 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2304 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-27 20:09:12,604 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2303))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2302) .cse0 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (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~mem144#1.base| v_ArrVal_2302) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-11-27 20:09:12,643 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2303))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2302) .cse1 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2302) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 2)))))) is different from false [2024-11-27 20:09:12,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2302) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 3))) (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2303))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2302) .cse2 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))))) is different from false [2024-11-27 20:09:12,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2301))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2300) .cse0 v_ArrVal_2302) (select (select (store .cse1 .cse0 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2304))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2301))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2303))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2300) .cse3 v_ArrVal_2302) .cse4 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-27 20:09:12,776 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2301))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2303))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2300) .cse1 v_ArrVal_2302) .cse2 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2301))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2300) .cse6 v_ArrVal_2302) (select (select (store .cse7 .cse6 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2304))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 3)))))) is different from false [2024-11-27 20:09:12,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2301))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2303))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2300) .cse1 v_ArrVal_2302) .cse2 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2301))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2300) .cse6 v_ArrVal_2302) (select (select (store .cse7 .cse6 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2304))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4)))))) is different from false [2024-11-27 20:09:12,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2299))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2301))) (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_#t~mem144#1.base| v_ArrVal_2298) .cse0 v_ArrVal_2300) .cse1 v_ArrVal_2302) (select (select (store .cse2 .cse1 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2304))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) 4))) (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2299))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2301))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2303))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2298) .cse5 v_ArrVal_2300) .cse6 v_ArrVal_2302) .cse7 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false [2024-11-27 20:09:13,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2299))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2301))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2303))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2298) .cse1 v_ArrVal_2300) .cse2 v_ArrVal_2302) .cse3 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2299))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2301))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2298) .cse8 v_ArrVal_2300) .cse9 v_ArrVal_2302) (select (select (store .cse10 .cse9 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2304))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4)))))) is different from false [2024-11-27 20:09:13,365 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2299))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2301))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2303))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ 5 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2298) .cse1 v_ArrVal_2300) .cse2 v_ArrVal_2302) .cse3 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2299))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_2301))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2298) .cse8 v_ArrVal_2300) .cse9 v_ArrVal_2302) (select (select (store .cse10 .cse9 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2304))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4)))))) is different from false [2024-11-27 20:09:15,433 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2296))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2299))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2301))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_2303))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2297) .cse0 v_ArrVal_2298) .cse1 v_ArrVal_2300) .cse2 v_ArrVal_2302) .cse3 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 5) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2296))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_2299))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_2301))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem143#1.base| v_ArrVal_2297) .cse9 v_ArrVal_2298) .cse10 v_ArrVal_2300) .cse11 v_ArrVal_2302) (select (select (store .cse12 .cse11 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_2304))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) 4))))) is different from false [2024-11-27 20:09:19,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (and (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2296))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_2299))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_2301))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse3 v_ArrVal_2303))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2297) .cse1 v_ArrVal_2298) .cse2 v_ArrVal_2300) .cse3 v_ArrVal_2302) .cse4 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 5) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2296))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_2299))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_2301))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2297) .cse10 v_ArrVal_2298) .cse11 v_ArrVal_2300) .cse12 v_ArrVal_2302) (select (select (store .cse13 .cse12 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2304))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4)))))) is different from false [2024-11-27 20:09:24,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2294))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_2296))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_2299))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_2301))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2295) .cse0 v_ArrVal_2297) .cse1 v_ArrVal_2298) .cse2 v_ArrVal_2300) .cse3 v_ArrVal_2302) (select (select (store .cse4 .cse3 v_ArrVal_2303) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_2304))))))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 4))) (forall ((v_ArrVal_2305 (Array Int Int)) (v_ArrVal_2304 (Array Int Int)) (v_ArrVal_2303 (Array Int Int)) (v_ArrVal_2302 (Array Int Int)) (v_ArrVal_2301 (Array Int Int)) (v_ArrVal_2300 (Array Int Int)) (v_ArrVal_2299 (Array Int Int)) (v_ArrVal_2298 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2294))) (let ((.cse9 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse17 (store .cse18 .cse9 v_ArrVal_2296))) (let ((.cse10 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse16 (store .cse17 .cse10 v_ArrVal_2299))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store .cse16 .cse11 v_ArrVal_2301))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_2303))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_2295) .cse9 v_ArrVal_2297) .cse10 v_ArrVal_2298) .cse11 v_ArrVal_2300) .cse12 v_ArrVal_2302) .cse13 v_ArrVal_2304) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) 5) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_2305) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))))))) is different from false [2024-11-27 20:09:25,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:25,154 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 1665 treesize of output 1666 [2024-11-27 20:09:25,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:09:25,201 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 1653 treesize of output 910 [2024-11-27 20:09:29,696 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 1030359439214 treesize of output 966552569798 [2024-11-27 20:22:07,359 WARN L286 SmtUtils]: Spent 12.62m on a formula simplification. DAG size of input: 67266 DAG size of output: 285 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-27 20:22:07,735 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 7583530299 treesize of output 7560388979 [2024-11-27 20:22:09,575 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 6664 treesize of output 5866 [2024-11-27 20:22:09,625 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 5866 treesize of output 5512 [2024-11-27 20:22:09,684 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 5512 treesize of output 5296 [2024-11-27 20:22:09,731 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 5296 treesize of output 5032 [2024-11-27 20:22:09,787 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 5032 treesize of output 4402 [2024-11-27 20:22:09,835 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 4402 treesize of output 4318 [2024-11-27 20:22:09,882 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 4318 treesize of output 3670 [2024-11-27 20:22:09,939 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 3670 treesize of output 3586 [2024-11-27 20:22:09,997 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 3586 treesize of output 3052 [2024-11-27 20:22:10,060 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 3052 treesize of output 2950 [2024-11-27 20:22:10,108 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 2950 treesize of output 2806 [2024-11-27 20:22:10,155 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 2806 treesize of output 2782 [2024-11-27 20:22:10,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:10,316 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 835 [2024-11-27 20:22:10,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 20:22:10,360 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 822 treesize of output 463 [2024-11-27 20:22:10,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:22:10,419 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 11400546 treesize of output 9192602 [2024-11-27 20:22:11,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:22:11,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-27 20:22:11,442 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-27 20:22:12,424 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-27 20:22:12,424 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-27 20:22:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 46 not checked. [2024-11-27 20:22:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061661246] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 20:22:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 20:22:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 22] total 50 [2024-11-27 20:22:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003340007] [2024-11-27 20:22:12,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 20:22:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-27 20:22:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:22:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-27 20:22:12,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1123, Unknown=15, NotChecked=1230, Total=2550 [2024-11-27 20:22:12,477 INFO L87 Difference]: Start difference. First operand 224 states and 250 transitions. Second operand has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:22:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:22:27,045 INFO L93 Difference]: Finished difference Result 231 states and 252 transitions. [2024-11-27 20:22:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-27 20:22:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-27 20:22:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:22:27,048 INFO L225 Difference]: With dead ends: 231 [2024-11-27 20:22:27,048 INFO L226 Difference]: Without dead ends: 231 [2024-11-27 20:22:27,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=395, Invalid=2200, Unknown=15, NotChecked=1680, Total=4290 [2024-11-27 20:22:27,050 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 217 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1894 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:22:27,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 934 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 922 Invalid, 0 Unknown, 1894 Unchecked, 8.0s Time] [2024-11-27 20:22:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-27 20:22:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2024-11-27 20:22:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 198 states have (on average 1.2323232323232323) internal successors, (244), 221 states have internal predecessors, (244), 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-27 20:22:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 246 transitions. [2024-11-27 20:22:27,057 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 246 transitions. Word has length 90 [2024-11-27 20:22:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:22:27,057 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 246 transitions. [2024-11-27 20:22:27,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.28) internal successors, (114), 50 states have internal predecessors, (114), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-27 20:22:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 246 transitions. [2024-11-27 20:22:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-27 20:22:27,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:22:27,059 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 5, 5, 1, 1, 1, 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-27 20:22:27,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-27 20:22:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-27 20:22:27,259 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2024-11-27 20:22:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:22:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -762621798, now seen corresponding path program 3 times [2024-11-27 20:22:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:22:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948242839] [2024-11-27 20:22:27,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:22:27,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:22:27,723 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 20:22:27,723 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:22:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:22:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:22:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948242839] [2024-11-27 20:22:34,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948242839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 20:22:34,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231423931] [2024-11-27 20:22:34,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:22:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:22:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:22:34,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:22:34,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f001ee61-67d9-4353-b850-0c4f3703aace/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 20:22:38,736 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 20:22:38,736 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:22:38,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-27 20:22:38,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:22:38,774 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-27 20:22:38,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-27 20:22:39,070 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-27 20:22:39,071 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-27 20:22:39,402 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-27 20:22:39,421 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-27 20:22:39,902 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-27 20:22:39,920 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-27 20:22:40,634 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:40,635 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-27 20:22:40,657 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-27 20:22:41,706 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:41,706 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-27 20:22:41,760 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-27 20:22:42,829 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:42,830 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-27 20:22:42,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-27 20:22:44,029 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:44,029 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-27 20:22:44,092 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-27 20:22:45,242 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:45,242 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-27 20:22:45,261 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-27 20:22:46,591 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-27 20:22:46,592 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-27 20:22:46,648 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-27 20:22:47,231 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-27 20:22:47,267 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-27 20:22:47,664 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-27 20:22:47,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 20:22:48,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2592 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-27 20:22:48,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2592 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1)))))) is different from false [2024-11-27 20:22:49,072 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2592 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-27 20:22:49,159 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2590 (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~mem144#1.base| v_ArrVal_2589) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2590))) (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~mem144#1.base| v_ArrVal_2589) .cse1 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))))) is different from false [2024-11-27 20:22:49,951 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2590))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2589) .cse1 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2589) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-27 20:22:50,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2587))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2590))) (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~mem144#1.base| v_ArrVal_2588) .cse0 v_ArrVal_2589) .cse1 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2587))) (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~mem144#1.base| v_ArrVal_2588) .cse5 v_ArrVal_2589) (select (select (store .cse6 .cse5 v_ArrVal_2590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_2592))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) |c_ULTIMATE.start_main_~j~0#1| 3))))) is different from false [2024-11-27 20:22:50,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2587))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2590))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2588) .cse1 v_ArrVal_2589) .cse2 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2587))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2588) .cse6 v_ArrVal_2589) (select (select (store .cse7 .cse6 v_ArrVal_2590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2592))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 3)))))) is different from false [2024-11-27 20:22:51,563 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~3#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2586 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2586))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2587))) (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_#t~mem144#1.base| v_ArrVal_2585) .cse0 v_ArrVal_2588) .cse1 v_ArrVal_2589) (select (select (store .cse2 .cse1 v_ArrVal_2590) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_2592))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 4))) (forall ((v_ArrVal_2589 (Array Int Int)) (v_ArrVal_2588 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (v_ArrVal_2586 (Array Int Int)) (v_ArrVal_2585 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2591 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem144#1.base| v_ArrVal_2586))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2587))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2590))) (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_#t~mem144#1.base| v_ArrVal_2585) .cse5 v_ArrVal_2588) .cse6 v_ArrVal_2589) .cse7 v_ArrVal_2592) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) |c_ULTIMATE.start_main_~j~0#1| 5) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2591) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))))) is different from false