./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:02:51,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:02:51,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:02:51,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:02:51,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:02:51,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:02:51,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:02:51,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:02:51,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:02:51,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:02:51,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:02:51,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:02:51,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:02:51,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:02:51,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:02:51,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:02:51,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:02:51,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:02:51,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:02:51,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:02:51,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:02:51,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:02:51,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:02:51,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:02:51,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:02:51,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:02:51,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:02:51,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:02:51,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:02:51,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:02:51,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:02:51,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:02:51,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:02:51,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:02:51,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:02:51,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:02:51,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:02:51,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:02:51,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:02:51,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:02:51,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:02:51,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:02:51,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:02:51,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:02:51,584 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:02:51,584 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:02:51,585 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:02:51,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:02:51,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:02:51,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:02:51,586 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:02:51,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:02:51,586 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:02:51,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:02:51,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:02:51,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:02:51,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:02:51,588 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:02:51,588 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:02:51,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:02:51,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:02:51,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:02:51,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:02:51,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:02:51,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:02:51,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:02:51,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:02:51,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:02:51,590 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:02:51,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:02:51,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:02:51,590 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-12-13 16:02:51,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:02:51,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:02:51,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:02:51,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:02:51,794 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:02:51,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-12-13 16:02:54,376 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:02:54,594 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:02:54,595 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-12-13 16:02:54,605 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/data/50c349511/d8dcdeafd54948af86a3d13541f4ea5f/FLAGb57b67d8f [2022-12-13 16:02:54,951 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/data/50c349511/d8dcdeafd54948af86a3d13541f4ea5f [2022-12-13 16:02:54,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:02:54,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:02:54,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:02:54,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:02:54,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:02:54,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:02:54" (1/1) ... [2022-12-13 16:02:54,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198ddc3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:54, skipping insertion in model container [2022-12-13 16:02:54,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:02:54" (1/1) ... [2022-12-13 16:02:54,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:02:54,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:02:55,161 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-12-13 16:02:55,167 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-12-13 16:02:55,170 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-12-13 16:02:55,171 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-12-13 16:02:55,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-12-13 16:02:55,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-12-13 16:02:55,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:02:55,182 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:02:55,205 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-12-13 16:02:55,207 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-12-13 16:02:55,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-12-13 16:02:55,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-12-13 16:02:55,211 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-12-13 16:02:55,212 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-12-13 16:02:55,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:02:55,228 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:02:55,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55 WrapperNode [2022-12-13 16:02:55,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:02:55,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:02:55,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:02:55,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:02:55,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,260 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-12-13 16:02:55,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:02:55,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:02:55,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:02:55,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:02:55,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:02:55,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:02:55,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:02:55,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:02:55,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (1/1) ... [2022-12-13 16:02:55,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:02:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:02:55,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:02:55,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:02:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 16:02:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:02:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:02:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:02:55,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:02:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:02:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:02:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:02:55,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:02:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:02:55,422 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:02:55,424 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:02:55,782 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:02:55,790 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:02:55,790 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-12-13 16:02:55,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:02:55 BoogieIcfgContainer [2022-12-13 16:02:55,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:02:55,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:02:55,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:02:55,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:02:55,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:02:54" (1/3) ... [2022-12-13 16:02:55,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b59bee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:02:55, skipping insertion in model container [2022-12-13 16:02:55,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:02:55" (2/3) ... [2022-12-13 16:02:55,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b59bee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:02:55, skipping insertion in model container [2022-12-13 16:02:55,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:02:55" (3/3) ... [2022-12-13 16:02:55,802 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-12-13 16:02:55,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:02:55,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-12-13 16:02:55,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:02:55,874 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@73053966, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:02:55,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-12-13 16:02:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 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) [2022-12-13 16:02:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 16:02:55,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:55,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 16:02:55,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 16:02:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:55,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674223625] [2022-12-13 16:02:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:56,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:56,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674223625] [2022-12-13 16:02:56,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674223625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:56,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:56,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:02:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780657242] [2022-12-13 16:02:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:02:56,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:02:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:02:56,060 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 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) 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) [2022-12-13 16:02:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:56,194 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-12-13 16:02:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:02:56,196 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 [2022-12-13 16:02:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:56,202 INFO L225 Difference]: With dead ends: 182 [2022-12-13 16:02:56,202 INFO L226 Difference]: Without dead ends: 178 [2022-12-13 16:02:56,203 INFO L412 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 [2022-12-13 16:02:56,205 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:56,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:02:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-13 16:02:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-12-13 16:02:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 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) [2022-12-13 16:02:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-12-13 16:02:56,233 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-12-13 16:02:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:56,233 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-12-13 16:02:56,233 INFO L496 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) [2022-12-13 16:02:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-12-13 16:02:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 16:02:56,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:56,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 16:02:56,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:02:56,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 16:02:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:56,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118533214] [2022-12-13 16:02:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:56,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118533214] [2022-12-13 16:02:56,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118533214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:56,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:56,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:02:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602542084] [2022-12-13 16:02:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:56,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:02:56,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:56,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:02:56,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:02:56,298 INFO L87 Difference]: Start difference. First operand 174 states and 185 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) [2022-12-13 16:02:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:56,403 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-12-13 16:02:56,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:02:56,403 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 [2022-12-13 16:02:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:56,405 INFO L225 Difference]: With dead ends: 175 [2022-12-13 16:02:56,405 INFO L226 Difference]: Without dead ends: 175 [2022-12-13 16:02:56,405 INFO L412 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 [2022-12-13 16:02:56,406 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:56,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:02:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-12-13 16:02:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-12-13 16:02:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 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) [2022-12-13 16:02:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-12-13 16:02:56,422 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-12-13 16:02:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:56,422 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-12-13 16:02:56,422 INFO L496 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) [2022-12-13 16:02:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-12-13 16:02:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 16:02:56,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:56,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:56,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:02:56,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:56,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-12-13 16:02:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:56,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746764904] [2022-12-13 16:02:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:56,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746764904] [2022-12-13 16:02:56,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746764904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:56,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:56,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:02:56,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494948998] [2022-12-13 16:02:56,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:56,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:02:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:56,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:02:56,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:02:56,568 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-12-13 16:02:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:56,720 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-12-13 16:02:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:02:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-12-13 16:02:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:56,722 INFO L225 Difference]: With dead ends: 178 [2022-12-13 16:02:56,722 INFO L226 Difference]: Without dead ends: 178 [2022-12-13 16:02:56,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:56,723 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:56,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 89 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:02:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-12-13 16:02:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-12-13 16:02:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 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) [2022-12-13 16:02:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-12-13 16:02:56,729 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-12-13 16:02:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:56,730 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-12-13 16:02:56,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2022-12-13 16:02:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-12-13 16:02:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 16:02:56,730 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:56,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:56,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:02:56,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-12-13 16:02:56,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:56,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755793275] [2022-12-13 16:02:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:56,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755793275] [2022-12-13 16:02:56,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755793275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:56,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:56,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:02:56,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95135212] [2022-12-13 16:02:56,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:56,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:02:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:02:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:02:56,921 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-12-13 16:02:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:57,182 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-12-13 16:02:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:02:57,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-12-13 16:02:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:57,183 INFO L225 Difference]: With dead ends: 258 [2022-12-13 16:02:57,183 INFO L226 Difference]: Without dead ends: 258 [2022-12-13 16:02:57,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:02:57,184 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 439 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:57,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 130 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:02:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-13 16:02:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-12-13 16:02:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 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) [2022-12-13 16:02:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-12-13 16:02:57,192 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-12-13 16:02:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:57,192 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-12-13 16:02:57,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2022-12-13 16:02:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-12-13 16:02:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 16:02:57,192 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:57,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:57,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:02:57,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-12-13 16:02:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469671909] [2022-12-13 16:02:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:57,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:57,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469671909] [2022-12-13 16:02:57,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469671909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:57,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:57,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:02:57,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74492035] [2022-12-13 16:02:57,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:57,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:02:57,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:57,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:02:57,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:02:57,220 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 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) [2022-12-13 16:02:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:57,237 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-12-13 16:02:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:02:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 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 11 [2022-12-13 16:02:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:57,241 INFO L225 Difference]: With dead ends: 266 [2022-12-13 16:02:57,241 INFO L226 Difference]: Without dead ends: 266 [2022-12-13 16:02:57,241 INFO L412 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 [2022-12-13 16:02:57,242 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:57,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:02:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-13 16:02:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-12-13 16:02:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 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) [2022-12-13 16:02:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-12-13 16:02:57,257 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-12-13 16:02:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:57,257 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-12-13 16:02:57,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-12-13 16:02:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-12-13 16:02:57,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 16:02:57,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:57,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:57,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:02:57,258 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-12-13 16:02:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:57,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163497737] [2022-12-13 16:02:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:57,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:57,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163497737] [2022-12-13 16:02:57,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163497737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:57,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:57,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:02:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079022086] [2022-12-13 16:02:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:57,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:02:57,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:57,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:02:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:57,388 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-12-13 16:02:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:57,568 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-12-13 16:02:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:02:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-12-13 16:02:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:57,570 INFO L225 Difference]: With dead ends: 232 [2022-12-13 16:02:57,570 INFO L226 Difference]: Without dead ends: 232 [2022-12-13 16:02:57,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:02:57,570 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:57,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:02:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-13 16:02:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-12-13 16:02:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 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) [2022-12-13 16:02:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-12-13 16:02:57,576 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-12-13 16:02:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:57,576 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-12-13 16:02:57,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-12-13 16:02:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-12-13 16:02:57,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 16:02:57,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:57,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:57,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:02:57,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:57,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-12-13 16:02:57,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:57,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501280843] [2022-12-13 16:02:57,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:57,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:57,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501280843] [2022-12-13 16:02:57,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501280843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:57,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:57,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:02:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506410628] [2022-12-13 16:02:57,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:57,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:02:57,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:57,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:02:57,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:57,641 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-12-13 16:02:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:57,782 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-12-13 16:02:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:02:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-12-13 16:02:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:57,784 INFO L225 Difference]: With dead ends: 231 [2022-12-13 16:02:57,784 INFO L226 Difference]: Without dead ends: 231 [2022-12-13 16:02:57,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:02:57,785 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:57,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 426 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:02:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-12-13 16:02:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-12-13 16:02:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 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) [2022-12-13 16:02:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-12-13 16:02:57,791 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-12-13 16:02:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:57,792 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-12-13 16:02:57,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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) [2022-12-13 16:02:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-12-13 16:02:57,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 16:02:57,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:57,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:57,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:02:57,793 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:57,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-12-13 16:02:57,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:57,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511943778] [2022-12-13 16:02:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:57,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:57,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511943778] [2022-12-13 16:02:57,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511943778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:57,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:57,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 16:02:57,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285242898] [2022-12-13 16:02:57,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:57,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:02:57,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:02:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:02:57,984 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2022-12-13 16:02:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:58,248 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-12-13 16:02:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:02:58,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-12-13 16:02:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:58,250 INFO L225 Difference]: With dead ends: 237 [2022-12-13 16:02:58,250 INFO L226 Difference]: Without dead ends: 237 [2022-12-13 16:02:58,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-12-13 16:02:58,251 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 296 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:58,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 289 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:02:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-12-13 16:02:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-12-13 16:02:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 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) [2022-12-13 16:02:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-12-13 16:02:58,257 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-12-13 16:02:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:58,257 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-12-13 16:02:58,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2022-12-13 16:02:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-12-13 16:02:58,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 16:02:58,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:58,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:58,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:02:58,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-12-13 16:02:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421675556] [2022-12-13 16:02:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:58,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:58,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421675556] [2022-12-13 16:02:58,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421675556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:58,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:58,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:02:58,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865428434] [2022-12-13 16:02:58,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:58,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 16:02:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:58,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 16:02:58,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:02:58,537 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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) [2022-12-13 16:02:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:59,059 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-12-13 16:02:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 16:02:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2022-12-13 16:02:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:59,060 INFO L225 Difference]: With dead ends: 232 [2022-12-13 16:02:59,060 INFO L226 Difference]: Without dead ends: 232 [2022-12-13 16:02:59,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-12-13 16:02:59,061 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 294 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:59,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 388 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:02:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-13 16:02:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-12-13 16:02:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 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) [2022-12-13 16:02:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-12-13 16:02:59,067 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-12-13 16:02:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:59,067 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-12-13 16:02:59,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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) [2022-12-13 16:02:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-12-13 16:02:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 16:02:59,068 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:59,068 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:02:59,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:02:59,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:59,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:59,068 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-12-13 16:02:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:59,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607602530] [2022-12-13 16:02:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:02:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:59,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607602530] [2022-12-13 16:02:59,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607602530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:02:59,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:02:59,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:02:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695686643] [2022-12-13 16:02:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:02:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:02:59,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:02:59,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:02:59,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:02:59,110 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:02:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:02:59,207 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-12-13 16:02:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:02:59,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 16:02:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:02:59,209 INFO L225 Difference]: With dead ends: 253 [2022-12-13 16:02:59,209 INFO L226 Difference]: Without dead ends: 253 [2022-12-13 16:02:59,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:02:59,210 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 297 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:02:59,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 202 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:02:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-13 16:02:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-12-13 16:02:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 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) [2022-12-13 16:02:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-12-13 16:02:59,216 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-12-13 16:02:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:02:59,216 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-12-13 16:02:59,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:02:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-12-13 16:02:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 16:02:59,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:02:59,216 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 16:02:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:02:59,217 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:02:59,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:02:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-12-13 16:02:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:02:59,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79146242] [2022-12-13 16:02:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:59,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:02:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:02:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:02:59,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79146242] [2022-12-13 16:02:59,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79146242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:02:59,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639338860] [2022-12-13 16:02:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:02:59,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:02:59,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:02:59,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:02:59,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:02:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:02:59,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 16:02:59,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:02:59,656 INFO L350 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 6 treesize of output 5 [2022-12-13 16:02:59,737 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:02:59,737 INFO L350 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 11 treesize of output 11 [2022-12-13 16:02:59,774 INFO L350 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 11 treesize of output 7 [2022-12-13 16:02:59,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:02:59,859 INFO L350 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 19 treesize of output 22 [2022-12-13 16:02:59,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:02:59,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 16:02:59,989 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:02:59,990 INFO L350 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 28 treesize of output 29 [2022-12-13 16:03:00,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:00,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:00,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-12-13 16:03:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:00,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:03:00,341 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-12-13 16:03:00,341 INFO L350 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 19 treesize of output 18 [2022-12-13 16:03:00,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-12-13 16:03:00,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-12-13 16:03:00,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:00,583 INFO L350 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 51 treesize of output 36 [2022-12-13 16:03:00,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:00,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 137 [2022-12-13 16:03:00,604 INFO L350 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 122 treesize of output 114 [2022-12-13 16:03:00,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:00,614 INFO L350 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 114 treesize of output 102 [2022-12-13 16:03:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:01,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639338860] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:03:01,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:03:01,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-12-13 16:03:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450029686] [2022-12-13 16:03:01,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:03:01,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 16:03:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 16:03:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=947, Unknown=10, NotChecked=126, Total=1190 [2022-12-13 16:03:01,037 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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) [2022-12-13 16:03:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:04,960 INFO L93 Difference]: Finished difference Result 427 states and 484 transitions. [2022-12-13 16:03:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 16:03:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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 31 [2022-12-13 16:03:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:04,963 INFO L225 Difference]: With dead ends: 427 [2022-12-13 16:03:04,963 INFO L226 Difference]: Without dead ends: 427 [2022-12-13 16:03:04,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=402, Invalid=2146, Unknown=10, NotChecked=198, Total=2756 [2022-12-13 16:03:04,965 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 998 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 675 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:04,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1491 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1957 Invalid, 0 Unknown, 675 Unchecked, 1.1s Time] [2022-12-13 16:03:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-12-13 16:03:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 239. [2022-12-13 16:03:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 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) [2022-12-13 16:03:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-12-13 16:03:04,973 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-12-13 16:03:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:04,973 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-12-13 16:03:04,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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) [2022-12-13 16:03:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-12-13 16:03:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 16:03:04,975 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:04,975 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 16:03:04,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:03:05,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 16:03:05,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-12-13 16:03:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:05,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353149941] [2022-12-13 16:03:05,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353149941] [2022-12-13 16:03:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353149941] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:03:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140235811] [2022-12-13 16:03:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:05,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:05,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:03:05,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:03:05,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:03:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:05,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 16:03:05,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:03:05,748 INFO L350 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 6 treesize of output 5 [2022-12-13 16:03:05,832 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:03:05,832 INFO L350 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 11 treesize of output 11 [2022-12-13 16:03:05,842 INFO L350 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 6 treesize of output 5 [2022-12-13 16:03:05,884 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 16:03:05,890 INFO L350 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 11 treesize of output 7 [2022-12-13 16:03:06,006 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:03:06,007 INFO L350 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 38 treesize of output 37 [2022-12-13 16:03:06,015 INFO L350 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 18 treesize of output 20 [2022-12-13 16:03:06,118 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:03:06,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 16:03:06,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:06,131 INFO L350 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 14 treesize of output 16 [2022-12-13 16:03:06,180 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:03:06,181 INFO L350 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 38 treesize of output 37 [2022-12-13 16:03:06,188 INFO L350 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 18 treesize of output 20 [2022-12-13 16:03:06,356 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:06,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 16:03:06,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:06,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:06,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-12-13 16:03:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:06,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:03:07,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:07,575 INFO L350 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 38 treesize of output 39 [2022-12-13 16:03:07,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:07,581 INFO L350 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 30 treesize of output 31 [2022-12-13 16:03:07,585 INFO L350 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 54 treesize of output 46 [2022-12-13 16:03:07,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:07,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2022-12-13 16:03:07,602 INFO L350 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 166 treesize of output 156 [2022-12-13 16:03:07,607 INFO L350 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 130 treesize of output 126 [2022-12-13 16:03:07,612 INFO L350 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 126 treesize of output 114 [2022-12-13 16:03:07,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:07,707 INFO L350 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 73 treesize of output 74 [2022-12-13 16:03:07,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:07,716 INFO L350 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 65 treesize of output 50 [2022-12-13 16:03:07,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:07,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:07,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:07,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-12-13 16:03:07,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:07,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:03:07,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-12-13 16:03:07,745 INFO L350 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 13 treesize of output 11 [2022-12-13 16:03:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:08,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140235811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:03:08,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:03:08,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2022-12-13 16:03:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713601923] [2022-12-13 16:03:08,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:03:08,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 16:03:08,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 16:03:08,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1107, Unknown=27, NotChecked=0, Total=1260 [2022-12-13 16:03:08,033 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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) [2022-12-13 16:03:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:10,411 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-12-13 16:03:10,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 16:03:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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 31 [2022-12-13 16:03:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:10,413 INFO L225 Difference]: With dead ends: 418 [2022-12-13 16:03:10,413 INFO L226 Difference]: Without dead ends: 418 [2022-12-13 16:03:10,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=434, Invalid=2401, Unknown=27, NotChecked=0, Total=2862 [2022-12-13 16:03:10,414 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1622 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:10,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1302 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 16:03:10,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-12-13 16:03:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-12-13 16:03:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 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) [2022-12-13 16:03:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-12-13 16:03:10,421 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-12-13 16:03:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:10,422 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-12-13 16:03:10,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 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) [2022-12-13 16:03:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-12-13 16:03:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 16:03:10,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:10,423 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:10,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 16:03:10,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:10,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-12-13 16:03:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:10,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053962943] [2022-12-13 16:03:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:10,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053962943] [2022-12-13 16:03:10,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053962943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:10,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:10,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:03:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258412675] [2022-12-13 16:03:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:10,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:03:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:03:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:03:10,692 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2022-12-13 16:03:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:10,700 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-12-13 16:03:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:03:10,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2022-12-13 16:03:10,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:10,702 INFO L225 Difference]: With dead ends: 241 [2022-12-13 16:03:10,702 INFO L226 Difference]: Without dead ends: 241 [2022-12-13 16:03:10,702 INFO L412 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 [2022-12-13 16:03:10,703 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:10,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:03:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-13 16:03:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-12-13 16:03:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 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) [2022-12-13 16:03:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-12-13 16:03:10,706 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-12-13 16:03:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:10,706 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-12-13 16:03:10,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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) [2022-12-13 16:03:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-12-13 16:03:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 16:03:10,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:10,707 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:10,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:03:10,707 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-12-13 16:03:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67505929] [2022-12-13 16:03:10,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:10,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67505929] [2022-12-13 16:03:10,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67505929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:10,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:10,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:03:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292626014] [2022-12-13 16:03:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:10,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:03:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:10,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:03:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:03:10,821 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:11,045 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-12-13 16:03:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:03:11,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 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 36 [2022-12-13 16:03:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:11,047 INFO L225 Difference]: With dead ends: 258 [2022-12-13 16:03:11,047 INFO L226 Difference]: Without dead ends: 258 [2022-12-13 16:03:11,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 16:03:11,048 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 50 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:11,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 554 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:03:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-13 16:03:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-12-13 16:03:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 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) [2022-12-13 16:03:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-12-13 16:03:11,053 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-12-13 16:03:11,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:11,053 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-12-13 16:03:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-12-13 16:03:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 16:03:11,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:11,053 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:11,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:03:11,054 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-12-13 16:03:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:11,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133931300] [2022-12-13 16:03:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:11,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133931300] [2022-12-13 16:03:11,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133931300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:11,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:11,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:03:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121818512] [2022-12-13 16:03:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:11,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:03:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:03:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:03:11,095 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:11,171 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-12-13 16:03:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:03:11,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 16:03:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:11,173 INFO L225 Difference]: With dead ends: 246 [2022-12-13 16:03:11,173 INFO L226 Difference]: Without dead ends: 246 [2022-12-13 16:03:11,174 INFO L412 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 [2022-12-13 16:03:11,174 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:11,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:03:11,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-12-13 16:03:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-12-13 16:03:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 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) [2022-12-13 16:03:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-12-13 16:03:11,180 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-12-13 16:03:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:11,180 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-12-13 16:03:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-12-13 16:03:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 16:03:11,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:11,180 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:11,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:03:11,181 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:11,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:11,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-12-13 16:03:11,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:11,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502854419] [2022-12-13 16:03:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:11,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502854419] [2022-12-13 16:03:11,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502854419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:11,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:11,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:03:11,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610258968] [2022-12-13 16:03:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:03:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:03:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:03:11,241 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:11,319 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-12-13 16:03:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:03:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 16:03:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:11,321 INFO L225 Difference]: With dead ends: 241 [2022-12-13 16:03:11,321 INFO L226 Difference]: Without dead ends: 241 [2022-12-13 16:03:11,321 INFO L412 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 [2022-12-13 16:03:11,322 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:11,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:03:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-13 16:03:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-12-13 16:03:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 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) [2022-12-13 16:03:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-12-13 16:03:11,327 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-12-13 16:03:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:11,328 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-12-13 16:03:11,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-12-13 16:03:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 16:03:11,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:11,328 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:11,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 16:03:11,328 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:11,329 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-12-13 16:03:11,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:11,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707907953] [2022-12-13 16:03:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:11,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707907953] [2022-12-13 16:03:11,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707907953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:11,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:11,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:03:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986701077] [2022-12-13 16:03:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:11,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:03:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:11,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:03:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:03:11,394 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:11,633 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-12-13 16:03:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:03:11,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 16:03:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:11,635 INFO L225 Difference]: With dead ends: 261 [2022-12-13 16:03:11,635 INFO L226 Difference]: Without dead ends: 261 [2022-12-13 16:03:11,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:03:11,636 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:11,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:03:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-12-13 16:03:11,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-12-13 16:03:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 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) [2022-12-13 16:03:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-12-13 16:03:11,640 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-12-13 16:03:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:11,640 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-12-13 16:03:11,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:03:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-12-13 16:03:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 16:03:11,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:11,641 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:11,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 16:03:11,641 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-12-13 16:03:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:11,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263035335] [2022-12-13 16:03:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263035335] [2022-12-13 16:03:12,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263035335] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:03:12,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729573250] [2022-12-13 16:03:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:03:12,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:03:12,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 16:03:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:12,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 16:03:12,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:03:12,180 INFO L350 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 6 treesize of output 5 [2022-12-13 16:03:12,250 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:03:12,250 INFO L350 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 11 treesize of output 11 [2022-12-13 16:03:12,287 INFO L350 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 11 treesize of output 7 [2022-12-13 16:03:12,294 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 16:03:12,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:03:12,384 INFO L350 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 29 treesize of output 30 [2022-12-13 16:03:12,389 INFO L350 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 18 treesize of output 20 [2022-12-13 16:03:12,409 INFO L350 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 16 treesize of output 8 [2022-12-13 16:03:12,464 INFO L350 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 14 treesize of output 16 [2022-12-13 16:03:12,491 INFO L350 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 14 treesize of output 16 [2022-12-13 16:03:12,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 16:03:12,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:12,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:12,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 17 [2022-12-13 16:03:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:12,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:03:12,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:12,850 INFO L350 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 32 treesize of output 36 [2022-12-13 16:03:13,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:13,392 INFO L350 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 36 treesize of output 37 [2022-12-13 16:03:13,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:13,397 INFO L350 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 28 treesize of output 29 [2022-12-13 16:03:13,401 INFO L350 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 50 treesize of output 42 [2022-12-13 16:03:13,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:13,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2022-12-13 16:03:13,417 INFO L350 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 136 [2022-12-13 16:03:13,423 INFO L350 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 114 treesize of output 110 [2022-12-13 16:03:13,428 INFO L350 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 [2022-12-13 16:03:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:13,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729573250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:03:13,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:03:13,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-12-13 16:03:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261100070] [2022-12-13 16:03:13,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:03:13,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 16:03:13,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:13,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 16:03:13,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1773, Unknown=21, NotChecked=0, Total=1980 [2022-12-13 16:03:13,715 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 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) [2022-12-13 16:03:17,920 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (<= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)) is different from false [2022-12-13 16:03:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:18,041 INFO L93 Difference]: Finished difference Result 558 states and 630 transitions. [2022-12-13 16:03:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-13 16:03:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 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 36 [2022-12-13 16:03:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:18,043 INFO L225 Difference]: With dead ends: 558 [2022-12-13 16:03:18,043 INFO L226 Difference]: Without dead ends: 558 [2022-12-13 16:03:18,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3269 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1643, Invalid=9048, Unknown=25, NotChecked=204, Total=10920 [2022-12-13 16:03:18,045 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 2477 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 237 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2477 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:18,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2477 Valid, 1951 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2591 Invalid, 5 Unknown, 0 Unchecked, 1.6s Time] [2022-12-13 16:03:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-12-13 16:03:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 269. [2022-12-13 16:03:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 239 states have (on average 1.301255230125523) internal successors, (311), 268 states have internal predecessors, (311), 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) [2022-12-13 16:03:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 311 transitions. [2022-12-13 16:03:18,055 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 311 transitions. Word has length 36 [2022-12-13 16:03:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:18,055 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 311 transitions. [2022-12-13 16:03:18,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 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) [2022-12-13 16:03:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 311 transitions. [2022-12-13 16:03:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 16:03:18,056 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:18,056 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:18,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 16:03:18,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 16:03:18,257 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-12-13 16:03:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:18,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043996108] [2022-12-13 16:03:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043996108] [2022-12-13 16:03:18,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043996108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:18,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:03:18,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:03:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216569902] [2022-12-13 16:03:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:18,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:03:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:03:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:03:18,383 INFO L87 Difference]: Start difference. First operand 269 states and 311 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-12-13 16:03:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:18,614 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2022-12-13 16:03:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:03:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 40 [2022-12-13 16:03:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:18,615 INFO L225 Difference]: With dead ends: 289 [2022-12-13 16:03:18,615 INFO L226 Difference]: Without dead ends: 289 [2022-12-13 16:03:18,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 16:03:18,615 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:18,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:03:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-12-13 16:03:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2022-12-13 16:03:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 245 states have (on average 1.3061224489795917) internal successors, (320), 274 states have internal predecessors, (320), 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) [2022-12-13 16:03:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 320 transitions. [2022-12-13 16:03:18,619 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 320 transitions. Word has length 40 [2022-12-13 16:03:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:18,619 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 320 transitions. [2022-12-13 16:03:18,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-12-13 16:03:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 320 transitions. [2022-12-13 16:03:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 16:03:18,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:18,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:18,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 16:03:18,620 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-12-13 16:03:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047373514] [2022-12-13 16:03:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047373514] [2022-12-13 16:03:19,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047373514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:03:19,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782501158] [2022-12-13 16:03:19,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:19,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:03:19,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:03:19,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 16:03:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:19,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 16:03:19,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:03:19,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-12-13 16:03:19,257 INFO L350 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 28 treesize of output 16 [2022-12-13 16:03:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 16:03:19,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:03:19,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782501158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:03:19,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 16:03:19,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-12-13 16:03:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660889584] [2022-12-13 16:03:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:03:19,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:03:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:03:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:03:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-12-13 16:03:19,306 INFO L87 Difference]: Start difference. First operand 275 states and 320 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-12-13 16:03:19,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:03:19,530 INFO L93 Difference]: Finished difference Result 284 states and 327 transitions. [2022-12-13 16:03:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:03:19,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 40 [2022-12-13 16:03:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:03:19,531 INFO L225 Difference]: With dead ends: 284 [2022-12-13 16:03:19,532 INFO L226 Difference]: Without dead ends: 284 [2022-12-13 16:03:19,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:03:19,532 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:03:19,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:03:19,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-12-13 16:03:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2022-12-13 16:03:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 245 states have (on average 1.2857142857142858) internal successors, (315), 272 states have internal predecessors, (315), 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) [2022-12-13 16:03:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 315 transitions. [2022-12-13 16:03:19,537 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 315 transitions. Word has length 40 [2022-12-13 16:03:19,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:03:19,538 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 315 transitions. [2022-12-13 16:03:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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) [2022-12-13 16:03:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 315 transitions. [2022-12-13 16:03:19,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 16:03:19,538 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:03:19,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:03:19,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 16:03:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:19,740 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:03:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:03:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-12-13 16:03:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:03:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956725830] [2022-12-13 16:03:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:03:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:03:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956725830] [2022-12-13 16:03:20,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956725830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:03:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94963558] [2022-12-13 16:03:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:03:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:03:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:03:20,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:03:20,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 16:03:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:03:20,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 16:03:20,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:03:20,491 INFO L350 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 6 treesize of output 5 [2022-12-13 16:03:20,558 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:03:20,559 INFO L350 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 11 treesize of output 11 [2022-12-13 16:03:20,585 INFO L350 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 11 treesize of output 7 [2022-12-13 16:03:20,648 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:03:20,648 INFO L350 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 19 treesize of output 22 [2022-12-13 16:03:20,723 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 16:03:20,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-12-13 16:03:20,732 INFO L350 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 19 treesize of output 18 [2022-12-13 16:03:20,811 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-12-13 16:03:20,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 70 [2022-12-13 16:03:20,824 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-13 16:03:20,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-12-13 16:03:21,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:21,217 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-12-13 16:03:21,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2022-12-13 16:03:21,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:03:21,227 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 16:03:21,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2022-12-13 16:03:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:03:21,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:03:39,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:39,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 810 treesize of output 629 [2022-12-13 16:03:40,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:03:40,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6311 treesize of output 4269 [2022-12-13 16:04:32,126 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse8 (not .cse6)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse27 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse127 (+ 8 v_arrayElimIndex_15))) (or (= .cse127 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse127 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse49 (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse126 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8)) (.cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse50 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse124 (+ 8 v_arrayElimCell_71))) (or (= .cse124 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse125 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse124 v_ArrVal_1019)))) (select .cse125 (select (select .cse125 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse60 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse122 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse121 (let ((.cse123 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse122 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse123 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse121 .cse122) 0) (= (select .cse121 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse10 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse120 (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse89 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse119 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse119 (select (select .cse119 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse61 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse118 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse117 v_ArrVal_1017) 0) (= (select .cse117 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse0 (+ 8 v_arrayElimCell_71))) (or (= .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse0 v_ArrVal_1019)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse4 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse4 v_ArrVal_1019)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (or .cse7 (< |c_ULTIMATE.start_main_~x~0#1.offset| 1)) (or .cse8 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse12 v_arrayElimCell_72) 0) (= (select .cse12 0) 0) (= (select .cse12 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse15 (+ 8 v_arrayElimCell_71))) (or (= .cse15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse15 v_ArrVal_1019)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse17 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse17 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse19 (+ 8 v_arrayElimIndex_15))) (or (= .cse19 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse19 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse20) (= .cse2 .cse20)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse22 (+ 8 v_arrayElimIndex_15))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse22 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse21) (= .cse22 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse21))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse23 v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse23 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse26 (+ 8 v_arrayElimIndex_15))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse26 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse25) (= .cse26 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse25) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse27 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse28 (+ 8 v_arrayElimCell_71))) (or (= .cse28 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse28 v_ArrVal_1019)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse29 0) 0) (= (select .cse29 v_arrayElimCell_71) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse31) (= .cse2 .cse31)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse32) (= .cse2 .cse32)))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse33) (= .cse2 .cse33)))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse34 v_arrayElimCell_71) 0) (= (select .cse34 v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse36 v_arrayElimCell_72) 0) (= (select .cse36 v_ArrVal_1017) 0) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse39 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse39 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse38) (= .cse2 .cse38)))) (= .cse39 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse40 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse41) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse43 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse43 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse2 .cse42)))) (= .cse43 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse46 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse46 v_ArrVal_1019)))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse44 v_arrayElimCell_72) 0) (= (select .cse44 0) 0)))) (= .cse46 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse48 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse47 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse48 v_ArrVal_1019)))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse48 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) .cse49 .cse50) .cse11) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| (+ |c_ULTIMATE.start_main_~x~0#1.offset| 1))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse51 (+ 8 v_arrayElimIndex_15))) (or (= .cse51 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse51 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse52) (= .cse2 .cse52))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse8 (let ((.cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse66 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse54 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse54 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse53 0) 0) (= (select .cse53 .cse54) 0) (= (select .cse53 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse57 0) 0) (= (select .cse57 v_ArrVal_1017) 0) (= (select .cse57 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse59 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse59 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse60 .cse61 (or (and .cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse62 0) 0) (= (select .cse62 v_ArrVal_1017) 0) (= (select .cse62 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse64 (let ((.cse65 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse64 v_ArrVal_1017) 0) (= (select .cse64 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse67 v_arrayElimCell_72) 0) (= (select .cse67 0) 0) (= (select .cse67 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse10 (and .cse27 .cse69)) (or .cse7 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse71 (+ 8 v_arrayElimIndex_15))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse71 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse70) (= .cse71 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse2 .cse70) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse49 (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse73 (select (select .cse73 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse72 v_ArrVal_1017) 0) (= (select .cse72 v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse10) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse74 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse74 (select (select .cse74 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse6) (or .cse7 .cse8) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse75) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse75) (= .cse2 .cse75)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse76) (= .cse2 .cse76)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse78 (+ 8 v_arrayElimCell_71))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse77 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse78 v_ArrVal_1019)))) (select .cse77 (select (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse78 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse81 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse81 v_ArrVal_1019)))) (select .cse80 (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse79 v_arrayElimCell_72) 0) (= (select .cse79 0) 0)))) (= .cse81 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse82 (+ 8 v_arrayElimIndex_15))) (or (= .cse82 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse82 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse83) (= .cse2 .cse83))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse6 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse84 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse84 (select (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) .cse50 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse85 (let ((.cse86 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse86 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse85 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse85 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse60 (or .cse6 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse87 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse87 (select (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse11) .cse88 .cse89)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse90) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse90)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse91 (let ((.cse92 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse92 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse91 0) 0) (= (select .cse91 v_arrayElimCell_71) 0) (= (select .cse91 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse93) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse2 .cse93)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse94 (+ 8 v_arrayElimIndex_15))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse94 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse94 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse95) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse96 0) 0) (= (select .cse96 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse98 (let ((.cse99 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse98 v_arrayElimCell_72) 0) (= (select .cse98 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse100 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse100 (select (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse101 (let ((.cse102 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse102 (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse101 v_arrayElimCell_72) 0) (= (select .cse101 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse89)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse103 (+ 8 v_arrayElimIndex_15))) (or (= .cse103 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse103 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse104) (= .cse2 .cse104)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse61 (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse105 v_arrayElimCell_72) 0) (= (select .cse105 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse107 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse107) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse107)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse108 (let ((.cse109 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse108 v_ArrVal_1017) 0) (= (select .cse108 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1019 Int)) (let ((.cse110 (let ((.cse111 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse111 (select (select .cse111 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_ArrVal_1017 Int)) (= (select .cse110 v_ArrVal_1017) 0)) (= (select .cse110 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse8) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse112) (= .cse2 .cse112)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse113 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse113) (= v_arrayElimIndex_15 0) (= .cse2 .cse113)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse114 (+ 8 v_arrayElimIndex_15))) (or (= .cse114 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse115 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse114 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse115) (= .cse2 .cse115)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116) (= .cse2 .cse116)))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) is different from true [2022-12-13 16:04:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:34,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94963558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:04:34,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:04:34,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2022-12-13 16:04:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978631715] [2022-12-13 16:04:34,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:04:34,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 16:04:34,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:04:34,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 16:04:34,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1433, Unknown=5, NotChecked=76, Total=1640 [2022-12-13 16:04:34,121 INFO L87 Difference]: Start difference. First operand 273 states and 315 transitions. Second operand has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 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) [2022-12-13 16:04:36,737 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse6 (= .cse2 |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse8 (not .cse6)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (let ((.cse27 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse127 (+ 8 v_arrayElimIndex_15))) (or (= .cse127 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse127 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse49 (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse126 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse126 (select (select .cse126 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8)) (.cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| 0)) (.cse50 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse124 (+ 8 v_arrayElimCell_71))) (or (= .cse124 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse125 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse124 v_ArrVal_1019)))) (select .cse125 (select (select .cse125 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse60 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse122 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse121 (let ((.cse123 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse122 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse123 (select (select .cse123 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse121 .cse122) 0) (= (select .cse121 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse10 (= |c_ULTIMATE.start_main_~x~0#1.offset| 0)) (.cse88 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse120 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse120 (select (select .cse120 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse89 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse119 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse119 (select (select .cse119 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse61 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse117 (let ((.cse118 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse118 (select (select .cse118 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse117 v_ArrVal_1017) 0) (= (select .cse117 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse11 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse0 (+ 8 v_arrayElimCell_71))) (or (= .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse0 v_ArrVal_1019)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse4 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse4 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse4 v_ArrVal_1019)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (or .cse7 (< |c_ULTIMATE.start_main_~x~0#1.offset| 1)) (or .cse8 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) 0) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse12 v_arrayElimCell_72) 0) (= (select .cse12 0) 0) (= (select .cse12 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse15 (+ 8 v_arrayElimCell_71))) (or (= .cse15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= (select (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse15 v_ArrVal_1019)))) (select .cse16 (select (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse17 (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse17 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse17 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse19 (+ 8 v_arrayElimIndex_15))) (or (= .cse19 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse19 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse20) (= .cse2 .cse20)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse22 (+ 8 v_arrayElimIndex_15))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse22 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse21) (= .cse22 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse21))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse23 v_arrayElimCell_71) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse23 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse26 (+ 8 v_arrayElimIndex_15))) (let ((.cse25 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse26 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse25) (= .cse26 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse25) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse27 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse28 (+ 8 v_arrayElimCell_71))) (or (= .cse28 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse29 (let ((.cse30 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse28 v_ArrVal_1019)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse29 0) 0) (= (select .cse29 v_arrayElimCell_71) 0))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse31) (= .cse2 .cse31)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse32 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse32) (= .cse2 .cse32)))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse33 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse33) (= .cse2 .cse33)))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse34 (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse35 (select (select .cse35 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse34 v_arrayElimCell_71) 0) (= (select .cse34 v_ArrVal_1017) 0)))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse36 v_arrayElimCell_72) 0) (= (select .cse36 v_ArrVal_1017) 0) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse39 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse38 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse39 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse38) (= .cse2 .cse38)))) (= .cse39 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse40 (+ 8 v_arrayElimIndex_15))) (let ((.cse41 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse40 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse40 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse41) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse41) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse43 (+ 8 v_arrayElimIndex_15))) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse42 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse43 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse42) (= .cse2 .cse42)))) (= .cse43 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse46 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse44 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse46 v_ArrVal_1019)))) (select .cse45 (select (select .cse45 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse44 v_arrayElimCell_72) 0) (= (select .cse44 0) 0)))) (= .cse46 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse48 (+ 8 v_arrayElimCell_71))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse47 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse48 v_ArrVal_1019)))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse48 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) .cse49 .cse50) .cse11) .cse11 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse7 (< |c_ULTIMATE.start_main_~head~0#1.offset| (+ |c_ULTIMATE.start_main_~x~0#1.offset| 1))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse10) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse51 (+ 8 v_arrayElimIndex_15))) (or (= .cse51 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse52 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse51 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse52) (= .cse2 .cse52))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse8 (let ((.cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse66 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse66 (select (select .cse66 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse54 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)))) (let ((.cse53 (let ((.cse55 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 .cse54 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse53 0) 0) (= (select .cse53 .cse54) 0) (= (select .cse53 v_ArrVal_1017) 0))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse57 (let ((.cse58 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse58 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse57 0) 0) (= (select .cse57 v_ArrVal_1017) 0) (= (select .cse57 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse59 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse59 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_ArrVal_1017) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse60 .cse61 (or (and .cse56 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse62 (let ((.cse63 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse63 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse62 0) 0) (= (select .cse62 v_ArrVal_1017) 0) (= (select .cse62 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse64 (let ((.cse65 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse65 (select (select .cse65 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse64 v_ArrVal_1017) 0) (= (select .cse64 v_arrayElimCell_72) 0)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse67 (let ((.cse68 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse67 v_arrayElimCell_72) 0) (= (select .cse67 0) 0) (= (select .cse67 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse10 (and .cse27 .cse69)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (or .cse7 .cse11) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse71 (+ 8 v_arrayElimIndex_15))) (let ((.cse70 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse71 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse70) (= .cse71 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (= .cse2 .cse70) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) .cse49 (or (forall ((v_arrayElimCell_72 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)))) (select .cse73 (select (select .cse73 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse72 v_ArrVal_1017) 0) (= (select .cse72 v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse11) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 (+ |v_ULTIMATE.start_main_~x~0#1.offset_86| (- 8)) 0) |v_ULTIMATE.start_main_~x~0#1.offset_86| v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (or (= v_arrayElimIndex_15 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse10) (or (forall ((v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse74 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse74 (select (select .cse74 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_71) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) .cse6) (or .cse7 .cse8) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and (not .cse11) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (= .cse2 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse75 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse75) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse75) (= .cse2 .cse75)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse8 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse76 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse76) (= .cse2 .cse76)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (let ((.cse78 (+ 8 v_arrayElimCell_71))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse77 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse78 v_ArrVal_1019)))) (select .cse77 (select (select .cse77 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (= .cse78 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse6) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimCell_71 Int)) (let ((.cse81 (+ 8 v_arrayElimCell_71))) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse79 (let ((.cse80 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) .cse81 v_ArrVal_1019)))) (select .cse80 (select (select .cse80 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse79 v_arrayElimCell_72) 0) (= (select .cse79 0) 0)))) (= .cse81 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse82 (+ 8 v_arrayElimIndex_15))) (or (= .cse82 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse83 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse82 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse83) (= .cse2 .cse83))))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or .cse11 (and (or .cse6 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse84 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse84 (select (select .cse84 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) .cse50 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int)) (or (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse85 (let ((.cse86 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse86 (select (select .cse86 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse85 v_arrayElimCell_72) 0) (forall ((v_ArrVal_1017 Int)) (= (select .cse85 v_ArrVal_1017) 0))))) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse60 (or .cse6 (and (or (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1019 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select (let ((.cse87 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse87 (select (select .cse87 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse11) .cse88 .cse89)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse90 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse90) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse90)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_71 Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse91 (let ((.cse92 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse92 (select (select .cse92 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse91 0) 0) (= (select .cse91 v_arrayElimCell_71) 0) (= (select .cse91 v_ArrVal_1017) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse93 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse93) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= .cse2 .cse93)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse94 (+ 8 v_arrayElimIndex_15))) (let ((.cse95 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse94 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= .cse94 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~head~0#1.base| .cse95) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse95) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse10) (or .cse6 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_ArrVal_1019 Int)) (let ((.cse96 (let ((.cse97 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_72 0) (+ 8 v_arrayElimCell_72) v_ArrVal_1019)))) (select .cse97 (select (select .cse97 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse96 0) 0) (= (select .cse96 v_arrayElimCell_72) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse98 (let ((.cse99 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse99 (select (select .cse99 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse98 v_arrayElimCell_72) 0) (= (select .cse98 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse88 (or .cse11 (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (= (select (let ((.cse100 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse100 (select (select .cse100 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) v_arrayElimCell_72) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (v_ArrVal_1019 Int)) (let ((.cse101 (let ((.cse102 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse102 (select (select .cse102 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse101 v_arrayElimCell_72) 0) (= (select .cse101 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) .cse89)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (let ((.cse103 (+ 8 v_arrayElimIndex_15))) (or (= .cse103 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (forall ((v_ArrVal_1019 Int)) (let ((.cse104 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse103 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse104) (= .cse2 .cse104)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse61 (or .cse11 (forall ((v_arrayElimCell_72 Int) (v_arrayElimCell_71 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse105 (let ((.cse106 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimCell_71 0) (+ 8 v_arrayElimCell_71) v_ArrVal_1019)))) (select .cse106 (select (select .cse106 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (= (select .cse105 v_arrayElimCell_72) 0) (= (select .cse105 v_ArrVal_1017) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= v_arrayElimCell_71 |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse107 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse107) (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15) (= .cse2 .cse107)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (or (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1017 Int) (v_ArrVal_1019 Int)) (let ((.cse108 (let ((.cse109 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse109 (select (select .cse109 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (= (select .cse108 v_ArrVal_1017) 0) (= (select .cse108 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_ArrVal_1019 Int)) (let ((.cse110 (let ((.cse111 (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_86|) v_ArrVal_1019)))) (select .cse111 (select (select .cse111 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (or (forall ((v_ArrVal_1017 Int)) (= (select .cse110 v_ArrVal_1017) 0)) (= (select .cse110 0) 0)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))) .cse8) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse112 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse112) (= .cse2 .cse112)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int)) (or (= v_arrayElimIndex_15 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (forall ((v_arrayElimIndex_15 Int) (v_ArrVal_1019 Int)) (let ((.cse113 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse113) (= v_arrayElimIndex_15 0) (= .cse2 .cse113)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse69 (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (let ((.cse114 (+ 8 v_arrayElimIndex_15))) (or (= .cse114 |v_ULTIMATE.start_main_~x~0#1.offset_86|) (= v_arrayElimIndex_15 0) (forall ((v_ArrVal_1019 Int)) (let ((.cse115 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) .cse114 v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse115) (= .cse2 .cse115)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimIndex_15)))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (forall ((v_arrayElimIndex_15 Int)) (or (forall ((v_ArrVal_1019 Int)) (let ((.cse116 (select (select (store |c_#memory_$Pointer$.base| .cse2 (store (store .cse3 v_arrayElimIndex_15 0) (+ 8 v_arrayElimIndex_15) v_ArrVal_1019)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| .cse116) (= .cse2 .cse116)))) (= v_arrayElimIndex_15 0))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_86|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_86| |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) is different from true [2022-12-13 16:04:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:46,761 INFO L93 Difference]: Finished difference Result 473 states and 533 transitions. [2022-12-13 16:04:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 16:04:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 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 40 [2022-12-13 16:04:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:46,763 INFO L225 Difference]: With dead ends: 473 [2022-12-13 16:04:46,763 INFO L226 Difference]: Without dead ends: 473 [2022-12-13 16:04:46,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=405, Invalid=2903, Unknown=6, NotChecked=226, Total=3540 [2022-12-13 16:04:46,764 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 974 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:46,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1823 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2164 Invalid, 0 Unknown, 288 Unchecked, 4.2s Time] [2022-12-13 16:04:46,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-12-13 16:04:46,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 276. [2022-12-13 16:04:46,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 248 states have (on average 1.282258064516129) internal successors, (318), 275 states have internal predecessors, (318), 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) [2022-12-13 16:04:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 318 transitions. [2022-12-13 16:04:46,768 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 318 transitions. Word has length 40 [2022-12-13 16:04:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:46,769 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 318 transitions. [2022-12-13 16:04:46,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 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) [2022-12-13 16:04:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 318 transitions. [2022-12-13 16:04:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 16:04:46,769 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:46,769 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:04:46,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 16:04:46,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 16:04:46,971 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:04:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1306466284, now seen corresponding path program 1 times [2022-12-13 16:04:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:04:46,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277821802] [2022-12-13 16:04:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:04:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:04:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277821802] [2022-12-13 16:04:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277821802] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:04:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592638952] [2022-12-13 16:04:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:04:47,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:04:47,517 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:04:47,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 16:04:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:47,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:04:47,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:48,062 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:04:48,063 INFO L350 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 11 treesize of output 11 [2022-12-13 16:04:48,115 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,122 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,132 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,139 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,148 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,153 INFO L350 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 14 treesize of output 16 [2022-12-13 16:04:48,200 INFO L350 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 15 treesize of output 7 [2022-12-13 16:04:48,205 INFO L350 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 15 treesize of output 7 [2022-12-13 16:04:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:48,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:04:48,260 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1156 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1157) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-12-13 16:04:48,627 INFO L350 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 55 treesize of output 47 [2022-12-13 16:04:48,632 INFO L350 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 5 treesize of output 3 [2022-12-13 16:04:48,908 INFO L350 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 30 treesize of output 22 [2022-12-13 16:04:49,065 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 16:04:49,065 INFO L350 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 [2022-12-13 16:04:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592638952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:04:49,073 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:04:49,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-12-13 16:04:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672043103] [2022-12-13 16:04:49,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:04:49,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 16:04:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:04:49,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 16:04:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=923, Unknown=2, NotChecked=62, Total=1122 [2022-12-13 16:04:49,075 INFO L87 Difference]: Start difference. First operand 276 states and 318 transitions. Second operand has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 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) [2022-12-13 16:04:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:04:55,361 INFO L93 Difference]: Finished difference Result 481 states and 538 transitions. [2022-12-13 16:04:55,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-13 16:04:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 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 42 [2022-12-13 16:04:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:04:55,364 INFO L225 Difference]: With dead ends: 481 [2022-12-13 16:04:55,364 INFO L226 Difference]: Without dead ends: 481 [2022-12-13 16:04:55,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1502, Invalid=7809, Unknown=5, NotChecked=190, Total=9506 [2022-12-13 16:04:55,369 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 1319 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 133 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:04:55,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1185 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1974 Invalid, 3 Unknown, 287 Unchecked, 2.4s Time] [2022-12-13 16:04:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-12-13 16:04:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 286. [2022-12-13 16:04:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 259 states have (on average 1.2625482625482625) internal successors, (327), 285 states have internal predecessors, (327), 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) [2022-12-13 16:04:55,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 327 transitions. [2022-12-13 16:04:55,376 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 327 transitions. Word has length 42 [2022-12-13 16:04:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:04:55,376 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 327 transitions. [2022-12-13 16:04:55,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.235294117647059) internal successors, (110), 34 states have internal predecessors, (110), 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) [2022-12-13 16:04:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 327 transitions. [2022-12-13 16:04:55,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-13 16:04:55,377 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:04:55,377 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:04:55,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 16:04:55,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 16:04:55,579 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:04:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:04:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1830693833, now seen corresponding path program 1 times [2022-12-13 16:04:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:04:55,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044326130] [2022-12-13 16:04:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:04:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:56,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:04:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044326130] [2022-12-13 16:04:56,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044326130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:04:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042108954] [2022-12-13 16:04:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:04:56,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:04:56,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:04:56,553 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:04:56,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 16:04:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:04:56,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 16:04:56,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:04:56,883 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 16:04:56,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 16:04:56,927 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 16:04:56,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 16:04:57,132 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 16:04:57,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 84 [2022-12-13 16:04:57,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:04:57,151 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 16:04:57,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2022-12-13 16:04:57,156 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 16:04:58,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:58,113 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-12-13 16:04:58,114 INFO L350 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2022-12-13 16:04:58,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:04:58,132 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-12-13 16:04:58,132 INFO L350 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 65 treesize of output 43 [2022-12-13 16:04:58,269 INFO L350 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 19 treesize of output 7 [2022-12-13 16:04:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:04:58,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:04:58,856 INFO L350 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 111 treesize of output 77 [2022-12-13 16:04:58,908 INFO L350 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 111 treesize of output 77 [2022-12-13 16:05:02,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:05:02,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 711 treesize of output 593 [2022-12-13 16:05:02,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:05:02,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 866 treesize of output 671 [2022-12-13 16:05:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:05:57,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042108954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:05:57,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:05:57,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-12-13 16:05:57,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26749442] [2022-12-13 16:05:57,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:05:57,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 16:05:57,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:05:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 16:05:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 16:05:57,318 INFO L87 Difference]: Start difference. First operand 286 states and 327 transitions. Second operand has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 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) [2022-12-13 16:06:07,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:06:07,368 INFO L93 Difference]: Finished difference Result 429 states and 482 transitions. [2022-12-13 16:06:07,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 16:06:07,369 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 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 42 [2022-12-13 16:06:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:06:07,369 INFO L225 Difference]: With dead ends: 429 [2022-12-13 16:06:07,369 INFO L226 Difference]: Without dead ends: 429 [2022-12-13 16:06:07,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=776, Invalid=4774, Unknown=0, NotChecked=0, Total=5550 [2022-12-13 16:06:07,370 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1250 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:06:07,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1449 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-12-13 16:06:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-12-13 16:06:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 294. [2022-12-13 16:06:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 267 states have (on average 1.2621722846441947) internal successors, (337), 293 states have internal predecessors, (337), 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) [2022-12-13 16:06:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 337 transitions. [2022-12-13 16:06:07,374 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 337 transitions. Word has length 42 [2022-12-13 16:06:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:06:07,374 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 337 transitions. [2022-12-13 16:06:07,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 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) [2022-12-13 16:06:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 337 transitions. [2022-12-13 16:06:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 16:06:07,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:06:07,374 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:07,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 16:06:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 16:06:07,576 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:06:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:07,577 INFO L85 PathProgramCache]: Analyzing trace with hash 916938157, now seen corresponding path program 1 times [2022-12-13 16:06:07,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:07,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669533093] [2022-12-13 16:06:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669533093] [2022-12-13 16:06:08,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669533093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:06:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495456969] [2022-12-13 16:06:08,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:06:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:06:08,239 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:06:08,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 16:06:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:08,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 16:06:08,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:06:08,643 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-13 16:06:08,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-12-13 16:06:08,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:06:08,763 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 16:06:08,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 16:06:09,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:06:09,290 INFO L321 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2022-12-13 16:06:09,290 INFO L350 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 25 [2022-12-13 16:06:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:09,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:06:09,388 INFO L350 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 8 treesize of output 6 [2022-12-13 16:06:09,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:06:09,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 170 [2022-12-13 16:06:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495456969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:06:10,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:06:10,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2022-12-13 16:06:10,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902548100] [2022-12-13 16:06:10,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:06:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 16:06:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:10,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 16:06:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 16:06:10,367 INFO L87 Difference]: Start difference. First operand 294 states and 337 transitions. Second operand has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 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) [2022-12-13 16:06:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:06:16,309 INFO L93 Difference]: Finished difference Result 514 states and 578 transitions. [2022-12-13 16:06:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-13 16:06:16,309 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 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 43 [2022-12-13 16:06:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:06:16,312 INFO L225 Difference]: With dead ends: 514 [2022-12-13 16:06:16,312 INFO L226 Difference]: Without dead ends: 514 [2022-12-13 16:06:16,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1365, Invalid=4955, Unknown=0, NotChecked=0, Total=6320 [2022-12-13 16:06:16,315 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1628 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:06:16,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1435 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 16:06:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-13 16:06:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 304. [2022-12-13 16:06:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 277 states have (on average 1.263537906137184) internal successors, (350), 303 states have internal predecessors, (350), 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) [2022-12-13 16:06:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 350 transitions. [2022-12-13 16:06:16,319 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 350 transitions. Word has length 43 [2022-12-13 16:06:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:06:16,319 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 350 transitions. [2022-12-13 16:06:16,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.5625) internal successors, (114), 33 states have internal predecessors, (114), 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) [2022-12-13 16:06:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 350 transitions. [2022-12-13 16:06:16,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 16:06:16,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:06:16,320 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:16,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 16:06:16,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:06:16,521 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:06:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:06:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -377567726, now seen corresponding path program 1 times [2022-12-13 16:06:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:06:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094811576] [2022-12-13 16:06:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:06:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:17,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:06:17,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094811576] [2022-12-13 16:06:17,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094811576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:06:17,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28796489] [2022-12-13 16:06:17,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:06:17,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:06:17,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:06:17,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:06:17,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 16:06:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:06:17,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 16:06:17,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:06:17,485 INFO L350 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 6 treesize of output 5 [2022-12-13 16:06:17,651 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:06:17,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 16:06:17,712 INFO L350 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 11 treesize of output 7 [2022-12-13 16:06:17,897 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:06:17,897 INFO L350 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 28 treesize of output 29 [2022-12-13 16:06:18,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:06:18,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 16:06:18,163 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:06:18,163 INFO L350 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 28 treesize of output 29 [2022-12-13 16:06:18,627 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-12-13 16:06:18,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-12-13 16:06:18,714 INFO L350 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 32 treesize of output 30 [2022-12-13 16:06:18,754 INFO L350 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 32 treesize of output 30 [2022-12-13 16:06:18,783 INFO L350 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 32 treesize of output 30 [2022-12-13 16:06:18,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:06:18,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 16:06:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:18,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:06:24,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:06:24,582 INFO L350 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 44 treesize of output 37 [2022-12-13 16:06:24,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:06:24,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1750 treesize of output 1629 [2022-12-13 16:06:24,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:06:24,637 INFO L350 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 1614 treesize of output 1558 [2022-12-13 16:06:24,652 INFO L350 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 1550 treesize of output 1518 [2022-12-13 16:06:24,666 INFO L350 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 1518 treesize of output 1454 [2022-12-13 16:06:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:06:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28796489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:06:54,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:06:54,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2022-12-13 16:06:54,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757651498] [2022-12-13 16:06:54,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:06:54,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-13 16:06:54,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:06:54,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-13 16:06:54,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1491, Unknown=28, NotChecked=0, Total=1722 [2022-12-13 16:06:54,291 INFO L87 Difference]: Start difference. First operand 304 states and 350 transitions. Second operand has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 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) [2022-12-13 16:06:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:06:59,871 INFO L93 Difference]: Finished difference Result 483 states and 542 transitions. [2022-12-13 16:06:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 16:06:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 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 45 [2022-12-13 16:06:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:06:59,872 INFO L225 Difference]: With dead ends: 483 [2022-12-13 16:06:59,872 INFO L226 Difference]: Without dead ends: 483 [2022-12-13 16:06:59,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=576, Invalid=3178, Unknown=28, NotChecked=0, Total=3782 [2022-12-13 16:06:59,873 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1678 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:06:59,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 1468 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-12-13 16:06:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-12-13 16:06:59,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 313. [2022-12-13 16:06:59,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.2622377622377623) internal successors, (361), 312 states have internal predecessors, (361), 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) [2022-12-13 16:06:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 361 transitions. [2022-12-13 16:06:59,876 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 361 transitions. Word has length 45 [2022-12-13 16:06:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:06:59,877 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 361 transitions. [2022-12-13 16:06:59,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.1463414634146343) internal successors, (129), 42 states have internal predecessors, (129), 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) [2022-12-13 16:06:59,877 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 361 transitions. [2022-12-13 16:06:59,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 16:06:59,877 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:06:59,877 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:06:59,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 16:07:00,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 16:07:00,079 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:07:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash -377567725, now seen corresponding path program 1 times [2022-12-13 16:07:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:00,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82254073] [2022-12-13 16:07:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:01,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:01,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82254073] [2022-12-13 16:07:01,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82254073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:07:01,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21944464] [2022-12-13 16:07:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:01,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:07:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:07:01,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:07:01,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 16:07:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:01,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 16:07:01,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:07:01,458 INFO L350 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 6 treesize of output 5 [2022-12-13 16:07:01,619 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:07:01,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 16:07:01,632 INFO L350 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 6 treesize of output 5 [2022-12-13 16:07:01,711 INFO L350 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 11 treesize of output 7 [2022-12-13 16:07:01,728 INFO L350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 16:07:01,949 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:01,950 INFO L350 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 47 treesize of output 44 [2022-12-13 16:07:01,958 INFO L350 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 18 treesize of output 20 [2022-12-13 16:07:02,201 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:02,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-12-13 16:07:02,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:07:02,223 INFO L350 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 14 treesize of output 16 [2022-12-13 16:07:02,325 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:02,325 INFO L350 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 47 treesize of output 44 [2022-12-13 16:07:02,340 INFO L350 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 18 treesize of output 20 [2022-12-13 16:07:02,884 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 16:07:02,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-12-13 16:07:02,928 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 16:07:02,929 INFO L350 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 20 treesize of output 22 [2022-12-13 16:07:03,007 INFO L350 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 32 treesize of output 30 [2022-12-13 16:07:03,024 INFO L350 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 14 treesize of output 16 [2022-12-13 16:07:03,046 INFO L350 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 14 treesize of output 16 [2022-12-13 16:07:03,055 INFO L350 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 32 treesize of output 30 [2022-12-13 16:07:03,080 INFO L350 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 32 treesize of output 30 [2022-12-13 16:07:03,086 INFO L350 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 14 treesize of output 16 [2022-12-13 16:07:03,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:07:03,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 16:07:03,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:07:03,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 16:07:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:03,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:07:03,366 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1650) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_1649 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmp~0#1.base| v_ArrVal_1649) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 4)))) is different from false [2022-12-13 16:07:20,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,331 INFO L350 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 41 treesize of output 42 [2022-12-13 16:07:20,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,341 INFO L350 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 33 treesize of output 34 [2022-12-13 16:07:20,348 INFO L350 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 60 treesize of output 52 [2022-12-13 16:07:20,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 351 [2022-12-13 16:07:20,377 INFO L350 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 336 treesize of output 316 [2022-12-13 16:07:20,387 INFO L350 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 258 treesize of output 254 [2022-12-13 16:07:20,395 INFO L350 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 312 treesize of output 302 [2022-12-13 16:07:20,407 INFO L350 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 246 treesize of output 234 [2022-12-13 16:07:20,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,805 INFO L350 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 82 treesize of output 83 [2022-12-13 16:07:20,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,817 INFO L350 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 74 treesize of output 59 [2022-12-13 16:07:20,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:07:20,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 349 [2022-12-13 16:07:20,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:07:20,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1070 treesize of output 1029 [2022-12-13 16:07:20,895 INFO L350 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 1014 treesize of output 974 [2022-12-13 16:07:20,907 INFO L350 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 974 treesize of output 958 [2022-12-13 16:07:20,919 INFO L350 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 958 treesize of output 918 [2022-12-13 16:07:20,944 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:20,945 INFO L350 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 918 treesize of output 850 [2022-12-13 16:07:25,448 INFO L350 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 193 treesize of output 189 [2022-12-13 16:07:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:31,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21944464] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:07:31,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:07:31,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2022-12-13 16:07:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604046514] [2022-12-13 16:07:31,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:07:31,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-13 16:07:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:07:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-13 16:07:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1527, Unknown=15, NotChecked=80, Total=1806 [2022-12-13 16:07:31,153 INFO L87 Difference]: Start difference. First operand 313 states and 361 transitions. Second operand has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 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) [2022-12-13 16:07:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:07:40,531 INFO L93 Difference]: Finished difference Result 400 states and 455 transitions. [2022-12-13 16:07:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 16:07:40,532 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 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 45 [2022-12-13 16:07:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:07:40,533 INFO L225 Difference]: With dead ends: 400 [2022-12-13 16:07:40,533 INFO L226 Difference]: Without dead ends: 400 [2022-12-13 16:07:40,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=537, Invalid=2992, Unknown=15, NotChecked=116, Total=3660 [2022-12-13 16:07:40,534 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 913 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 105 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:07:40,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1580 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2037 Invalid, 23 Unknown, 176 Unchecked, 5.4s Time] [2022-12-13 16:07:40,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-12-13 16:07:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 313. [2022-12-13 16:07:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.2587412587412588) internal successors, (360), 312 states have internal predecessors, (360), 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) [2022-12-13 16:07:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 360 transitions. [2022-12-13 16:07:40,538 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 360 transitions. Word has length 45 [2022-12-13 16:07:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:07:40,538 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 360 transitions. [2022-12-13 16:07:40,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.142857142857143) internal successors, (132), 43 states have internal predecessors, (132), 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) [2022-12-13 16:07:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 360 transitions. [2022-12-13 16:07:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 16:07:40,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:07:40,539 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:07:40,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 16:07:40,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:07:40,739 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-12-13 16:07:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:07:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1349607265, now seen corresponding path program 2 times [2022-12-13 16:07:40,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:07:40,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150578931] [2022-12-13 16:07:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:07:40,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:07:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:07:42,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:42,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:07:42,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150578931] [2022-12-13 16:07:42,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150578931] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:07:42,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853843971] [2022-12-13 16:07:42,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:07:42,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:07:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:07:42,088 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:07:42,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_026ff847-fc71-4f08-80bf-b934992299db/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 16:07:42,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 16:07:42,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:07:42,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-13 16:07:42,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:07:42,229 INFO L350 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 6 treesize of output 5 [2022-12-13 16:07:42,508 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:07:42,509 INFO L350 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 11 treesize of output 11 [2022-12-13 16:07:42,609 INFO L350 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 11 treesize of output 7 [2022-12-13 16:07:42,879 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:42,879 INFO L350 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 19 treesize of output 22 [2022-12-13 16:07:43,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:43,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 16:07:43,334 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:07:43,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 16:07:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:07:43,416 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 16:07:43,417 INFO L350 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 [2022-12-13 16:07:43,538 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 16:07:43,539 INFO L350 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-12-13 16:07:43,884 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-13 16:07:43,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2022-12-13 16:07:44,221 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 16:07:44,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 53 [2022-12-13 16:07:44,368 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 16:07:44,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-12-13 16:07:44,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:07:44,946 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-12-13 16:07:44,946 INFO L350 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 53 treesize of output 27 [2022-12-13 16:07:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:07:44,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:07:47,069 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-12-13 16:07:47,070 INFO L350 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 45 treesize of output 44 [2022-12-13 16:07:47,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int) (v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1803))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-12-13 16:07:47,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:47,306 INFO L350 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-13 16:07:47,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_113| Int) (v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_13 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= 0 (select |c_#valid| .cse0))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_113| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_13) .cse0 v_ArrVal_1803))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1805)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_113|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_113|))))) is different from false [2022-12-13 16:07:48,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:48,415 INFO L350 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 134 treesize of output 86 [2022-12-13 16:07:48,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:48,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18106 treesize of output 15157 [2022-12-13 16:07:48,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:48,610 INFO L350 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 15142 treesize of output 14228 [2022-12-13 16:07:48,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:48,703 INFO L350 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 14206 treesize of output 12104 [2022-12-13 16:07:48,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:07:48,797 INFO L350 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 12090 treesize of output 11402 [2022-12-13 16:07:48,872 INFO L350 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 11394 treesize of output 10754 [2022-12-13 16:07:49,109 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-12-13 16:07:49,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61