./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 e04fb08f 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_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:10:36,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:10:36,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:10:36,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:10:36,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:10:36,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:10:36,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:10:36,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:10:36,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:10:36,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:10:36,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:10:36,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:10:36,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:10:36,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:10:36,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:10:36,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:10:36,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:10:36,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:10:36,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:10:36,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:10:36,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:10:36,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:10:36,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:10:36,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:10:36,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:10:36,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:10:36,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:10:36,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:10:36,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:10:36,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:10:36,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:10:36,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:10:36,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:10:36,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:10:36,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:10:36,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:10:36,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:10:36,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:10:36,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:10:36,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:10:36,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:10:36,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:10:36,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:10:36,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:10:36,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:10:36,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:10:36,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:10:36,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:10:36,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:10:36,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:10:36,307 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:10:36,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:10:36,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:10:36,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:10:36,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:10:36,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:10:36,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:10:36,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:10:36,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:10:36,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:10:36,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:10:36,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:10:36,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:10:36,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:10:36,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:10:36,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:10:36,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:10:36,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:10:36,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:10:36,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:10:36,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:10:36,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:10:36,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/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_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8 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-11-16 11:10:36,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:10:36,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:10:36,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:10:36,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:10:36,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:10:36,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-16 11:10:36,769 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/data/da43759c4/9004f0031f254a65a08e3635a49c88bc/FLAG330ba985d [2022-11-16 11:10:37,485 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:10:37,486 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-16 11:10:37,502 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/data/da43759c4/9004f0031f254a65a08e3635a49c88bc/FLAG330ba985d [2022-11-16 11:10:37,725 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/data/da43759c4/9004f0031f254a65a08e3635a49c88bc [2022-11-16 11:10:37,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:10:37,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:10:37,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:10:37,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:10:37,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:10:37,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:37" (1/1) ... [2022-11-16 11:10:37,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b3d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:37, skipping insertion in model container [2022-11-16 11:10:37,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:10:37" (1/1) ... [2022-11-16 11:10:37,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:10:37,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:10:38,193 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-16 11:10:38,198 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-16 11:10:38,202 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-16 11:10:38,203 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-16 11:10:38,205 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-16 11:10:38,206 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-16 11:10:38,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:10:38,220 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:10:38,262 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-16 11:10:38,265 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-16 11:10:38,270 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-16 11:10:38,271 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-16 11:10:38,273 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-16 11:10:38,274 WARN L229 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_6ce114a7-267b-49e8-a240-15014ecbfd74/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-16 11:10:38,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:10:38,327 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:10:38,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38 WrapperNode [2022-11-16 11:10:38,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:10:38,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:10:38,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:10:38,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:10:38,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,426 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-11-16 11:10:38,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:10:38,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:10:38,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:10:38,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:10:38,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,466 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:10:38,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:10:38,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:10:38,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:10:38,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (1/1) ... [2022-11-16 11:10:38,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:10:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:38,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:10:38,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:10:38,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:10:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:10:38,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:10:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:10:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:10:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:10:38,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:10:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:10:38,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:10:38,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:10:38,805 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:10:38,807 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:10:39,500 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:10:39,510 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:10:39,510 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-16 11:10:39,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:10:39 BoogieIcfgContainer [2022-11-16 11:10:39,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:10:39,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:10:39,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:10:39,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:10:39,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:10:37" (1/3) ... [2022-11-16 11:10:39,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2893772f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:39, skipping insertion in model container [2022-11-16 11:10:39,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:10:38" (2/3) ... [2022-11-16 11:10:39,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2893772f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:10:39, skipping insertion in model container [2022-11-16 11:10:39,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:10:39" (3/3) ... [2022-11-16 11:10:39,525 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-11-16 11:10:39,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:10:39,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-11-16 11:10:39,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:10:39,629 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=FINITE_AUTOMATA, 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;@4fc00796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:10:39,629 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-16 11:10:39,635 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-11-16 11:10:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:10:39,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:39,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:10:39,643 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-11-16 11:10:39,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-16 11:10:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:39,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601876991] [2022-11-16 11:10:39,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:39,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:39,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601876991] [2022-11-16 11:10:39,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601876991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:39,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:39,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:39,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232779646] [2022-11-16 11:10:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:39,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:39,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:39,955 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-11-16 11:10:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:40,225 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-11-16 11:10:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:40,227 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-11-16 11:10:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:40,242 INFO L225 Difference]: With dead ends: 182 [2022-11-16 11:10:40,242 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 11:10:40,244 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-11-16 11:10:40,249 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:40,250 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.2s Time] [2022-11-16 11:10:40,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 11:10:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-11-16 11:10:40,290 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-11-16 11:10:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-11-16 11:10:40,295 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-11-16 11:10:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:40,295 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-11-16 11:10:40,295 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-11-16 11:10:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-11-16 11:10:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:10:40,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:40,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:10:40,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:10:40,297 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-11-16 11:10:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:40,298 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-16 11:10:40,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:40,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606995058] [2022-11-16 11:10:40,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:40,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:40,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:40,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606995058] [2022-11-16 11:10:40,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606995058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:40,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:40,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:40,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034326345] [2022-11-16 11:10:40,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:40,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:40,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:40,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:40,411 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-11-16 11:10:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:40,577 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-11-16 11:10:40,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:40,578 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-11-16 11:10:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:40,580 INFO L225 Difference]: With dead ends: 175 [2022-11-16 11:10:40,580 INFO L226 Difference]: Without dead ends: 175 [2022-11-16 11:10:40,580 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-11-16 11:10:40,582 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-11-16 11:10:40,588 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-11-16 11:10:40,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-16 11:10:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-11-16 11:10:40,603 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-11-16 11:10:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-11-16 11:10:40,605 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-11-16 11:10:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:40,606 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-11-16 11:10:40,606 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-11-16 11:10:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-11-16 11:10:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:10:40,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:40,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:40,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:10:40,611 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-11-16 11:10:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-11-16 11:10:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:40,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039645838] [2022-11-16 11:10:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:40,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:40,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039645838] [2022-11-16 11:10:40,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039645838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:40,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:40,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:40,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20028640] [2022-11-16 11:10:40,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:40,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:40,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:40,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:40,918 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-11-16 11:10:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:41,228 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-11-16 11:10:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:41,229 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-11-16 11:10:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:41,230 INFO L225 Difference]: With dead ends: 178 [2022-11-16 11:10:41,230 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 11:10:41,231 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-11-16 11:10:41,232 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 298 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:41,232 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.3s Time] [2022-11-16 11:10:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 11:10:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-11-16 11:10:41,240 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-11-16 11:10:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-11-16 11:10:41,242 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-11-16 11:10:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:41,242 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-11-16 11:10:41,242 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-11-16 11:10:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-11-16 11:10:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:10:41,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:41,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:41,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:10:41,244 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-11-16 11:10:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:41,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-11-16 11:10:41,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:41,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052764317] [2022-11-16 11:10:41,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:41,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:41,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052764317] [2022-11-16 11:10:41,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052764317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:41,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:41,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983694407] [2022-11-16 11:10:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:41,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:10:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:10:41,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:10:41,556 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-11-16 11:10:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:42,020 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-11-16 11:10:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:42,021 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-11-16 11:10:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:42,022 INFO L225 Difference]: With dead ends: 258 [2022-11-16 11:10:42,022 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 11:10:42,022 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-11-16 11:10:42,024 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 443 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:42,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 130 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:10:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 11:10:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-11-16 11:10:42,034 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-11-16 11:10:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-11-16 11:10:42,036 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-11-16 11:10:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:42,037 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-11-16 11:10:42,037 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-11-16 11:10:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-11-16 11:10:42,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:10:42,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:42,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:42,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:10:42,038 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-11-16 11:10:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-11-16 11:10:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:42,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128647374] [2022-11-16 11:10:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:42,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:42,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128647374] [2022-11-16 11:10:42,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128647374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:42,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:42,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:42,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094531587] [2022-11-16 11:10:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:42,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:42,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:42,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:42,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:42,082 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-11-16 11:10:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:42,106 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-11-16 11:10:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:42,107 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-11-16 11:10:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:42,109 INFO L225 Difference]: With dead ends: 266 [2022-11-16 11:10:42,109 INFO L226 Difference]: Without dead ends: 266 [2022-11-16 11:10:42,110 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-11-16 11:10:42,111 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-11-16 11:10:42,112 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-11-16 11:10:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-16 11:10:42,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-11-16 11:10:42,137 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-11-16 11:10:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-11-16 11:10:42,138 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-11-16 11:10:42,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:42,139 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-11-16 11:10:42,139 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-11-16 11:10:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-11-16 11:10:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:10:42,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:42,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:10:42,141 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-11-16 11:10:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:42,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-16 11:10:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:42,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813627065] [2022-11-16 11:10:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813627065] [2022-11-16 11:10:42,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813627065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:42,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:42,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339819244] [2022-11-16 11:10:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:42,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:42,493 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-11-16 11:10:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:42,819 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-11-16 11:10:42,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:42,820 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-11-16 11:10:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:42,821 INFO L225 Difference]: With dead ends: 232 [2022-11-16 11:10:42,821 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 11:10:42,822 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-11-16 11:10:42,823 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 7 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:42,824 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.3s Time] [2022-11-16 11:10:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 11:10:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-16 11:10:42,832 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-11-16 11:10:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-11-16 11:10:42,834 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-11-16 11:10:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:42,835 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-11-16 11:10:42,835 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-11-16 11:10:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-11-16 11:10:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:10:42,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:42,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:42,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:10:42,837 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-11-16 11:10:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-16 11:10:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:42,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919399977] [2022-11-16 11:10:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:42,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:42,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:42,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919399977] [2022-11-16 11:10:42,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919399977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:42,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:42,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769267759] [2022-11-16 11:10:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:42,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:10:42,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:10:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:42,959 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-11-16 11:10:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:43,201 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-11-16 11:10:43,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:10:43,202 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-11-16 11:10:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:43,203 INFO L225 Difference]: With dead ends: 231 [2022-11-16 11:10:43,203 INFO L226 Difference]: Without dead ends: 231 [2022-11-16 11:10:43,204 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-11-16 11:10:43,205 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:43,205 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.2s Time] [2022-11-16 11:10:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-16 11:10:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-11-16 11:10:43,210 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-11-16 11:10:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-11-16 11:10:43,211 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-11-16 11:10:43,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:43,211 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-11-16 11:10:43,211 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-11-16 11:10:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-11-16 11:10:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:10:43,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:43,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:43,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:10:43,217 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-11-16 11:10:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-16 11:10:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:43,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865799580] [2022-11-16 11:10:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:43,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:43,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865799580] [2022-11-16 11:10:43,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865799580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:43,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:43,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:10:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657139728] [2022-11-16 11:10:43,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:43,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:10:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:10:43,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:10:43,542 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-11-16 11:10:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:43,988 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-11-16 11:10:43,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:10:43,989 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-11-16 11:10:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:43,990 INFO L225 Difference]: With dead ends: 237 [2022-11-16 11:10:43,990 INFO L226 Difference]: Without dead ends: 237 [2022-11-16 11:10:43,990 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-11-16 11:10:43,991 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 298 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:43,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 289 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:10:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-16 11:10:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-11-16 11:10:43,996 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-11-16 11:10:43,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-11-16 11:10:43,998 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-11-16 11:10:43,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:43,998 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-11-16 11:10:43,999 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-11-16 11:10:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-11-16 11:10:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:10:43,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:44,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:10:44,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:10:44,000 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-11-16 11:10:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:44,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-16 11:10:44,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:44,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888071966] [2022-11-16 11:10:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:44,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888071966] [2022-11-16 11:10:44,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888071966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:44,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:44,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:10:44,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195061695] [2022-11-16 11:10:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:44,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:10:44,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:44,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:10:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:10:44,468 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-11-16 11:10:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:45,349 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-11-16 11:10:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:10:45,350 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-11-16 11:10:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:45,351 INFO L225 Difference]: With dead ends: 232 [2022-11-16 11:10:45,351 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 11:10:45,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:10:45,352 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 296 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:45,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 388 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:10:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 11:10:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-11-16 11:10:45,357 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-11-16 11:10:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-11-16 11:10:45,358 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-11-16 11:10:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:45,359 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-11-16 11:10:45,359 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-11-16 11:10:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-11-16 11:10:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:10:45,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:45,360 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-11-16 11:10:45,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:10:45,360 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-11-16 11:10:45,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-11-16 11:10:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:45,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991532253] [2022-11-16 11:10:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:45,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991532253] [2022-11-16 11:10:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991532253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:45,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:45,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:45,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12201143] [2022-11-16 11:10:45,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:45,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:45,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:45,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:45,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:45,431 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-11-16 11:10:45,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:45,606 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-11-16 11:10:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:45,607 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-11-16 11:10:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:45,608 INFO L225 Difference]: With dead ends: 253 [2022-11-16 11:10:45,608 INFO L226 Difference]: Without dead ends: 253 [2022-11-16 11:10:45,609 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-11-16 11:10:45,609 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:45,610 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.2s Time] [2022-11-16 11:10:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-16 11:10:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-11-16 11:10:45,615 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-11-16 11:10:45,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-11-16 11:10:45,616 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-11-16 11:10:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:45,616 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-11-16 11:10:45,616 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-11-16 11:10:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-11-16 11:10:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:10:45,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:45,617 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-11-16 11:10:45,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:10:45,618 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-11-16 11:10:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:45,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-11-16 11:10:45,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:45,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222809793] [2022-11-16 11:10:45,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:45,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222809793] [2022-11-16 11:10:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222809793] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:10:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093428591] [2022-11-16 11:10:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:46,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:46,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:46,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:10:46,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:10:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:46,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 11:10:46,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:46,463 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-11-16 11:10:46,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:10:46,594 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-11-16 11:10:46,715 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-11-16 11:10:46,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:46,864 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-11-16 11:10:47,021 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:47,021 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-11-16 11:10:47,140 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:47,141 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-11-16 11:10:47,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:47,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:47,363 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-11-16 11:10:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:47,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:10:47,781 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-16 11:10:47,782 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-11-16 11:10:48,084 WARN L833 $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-11-16 11:10:48,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:48,240 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-11-16 11:10:48,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:48,267 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-11-16 11:10:48,281 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-11-16 11:10:48,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:48,299 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-11-16 11:10:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:48,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093428591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:10:48,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:10:48,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-11-16 11:10:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678112749] [2022-11-16 11:10:48,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:10:48,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 11:10:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 11:10:48,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1006, Unknown=11, NotChecked=64, Total=1190 [2022-11-16 11:10:48,939 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-11-16 11:10:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:51,235 INFO L93 Difference]: Finished difference Result 419 states and 476 transitions. [2022-11-16 11:10:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:10:51,236 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-11-16 11:10:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:51,238 INFO L225 Difference]: With dead ends: 419 [2022-11-16 11:10:51,238 INFO L226 Difference]: Without dead ends: 419 [2022-11-16 11:10:51,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=438, Invalid=2311, Unknown=11, NotChecked=102, Total=2862 [2022-11-16 11:10:51,240 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1005 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1383 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:51,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1578 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1375 Invalid, 0 Unknown, 1383 Unchecked, 1.2s Time] [2022-11-16 11:10:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-16 11:10:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 239. [2022-11-16 11:10:51,246 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-11-16 11:10:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-11-16 11:10:51,247 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-11-16 11:10:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:51,248 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-11-16 11:10:51,248 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-11-16 11:10:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-11-16 11:10:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:10:51,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:51,250 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-11-16 11:10:51,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:51,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:51,456 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-11-16 11:10:51,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-11-16 11:10:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:51,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81045928] [2022-11-16 11:10:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:51,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:52,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81045928] [2022-11-16 11:10:52,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81045928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:10:52,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139600080] [2022-11-16 11:10:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:52,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:52,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:52,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:10:52,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:10:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:52,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 11:10:52,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:52,356 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-11-16 11:10:52,467 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:10:52,467 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-11-16 11:10:52,478 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-11-16 11:10:52,524 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-11-16 11:10:52,531 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-11-16 11:10:52,669 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:52,669 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-11-16 11:10:52,679 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-11-16 11:10:52,822 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:52,823 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-11-16 11:10:52,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:10:52,841 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-11-16 11:10:52,903 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:10:52,904 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-11-16 11:10:52,912 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-11-16 11:10:53,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:53,190 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-11-16 11:10:53,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:53,201 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:53,201 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-11-16 11:10:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:53,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:10:54,259 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-11-16 11:10:54,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:54,547 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-11-16 11:10:54,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:54,556 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-11-16 11:10:54,563 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-11-16 11:10:54,594 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:54,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-11-16 11:10:54,610 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-11-16 11:10:54,619 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-11-16 11:10:54,628 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-11-16 11:10:54,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:54,786 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-11-16 11:10:54,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:10:54,798 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-11-16 11:10:54,804 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:54,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:54,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:10:54,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:10:54,812 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-11-16 11:10:54,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:10:54,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:10:54,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:10:54,836 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-11-16 11:10:54,850 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-11-16 11:10:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:10:55,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139600080] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:10:55,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:10:55,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2022-11-16 11:10:55,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420270121] [2022-11-16 11:10:55,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:10:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 11:10:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 11:10:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1057, Unknown=12, NotChecked=66, Total=1260 [2022-11-16 11:10:55,257 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-11-16 11:10:57,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:57,839 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-11-16 11:10:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:10:57,840 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-11-16 11:10:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:57,842 INFO L225 Difference]: With dead ends: 418 [2022-11-16 11:10:57,842 INFO L226 Difference]: Without dead ends: 418 [2022-11-16 11:10:57,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=432, Invalid=2316, Unknown=12, NotChecked=102, Total=2862 [2022-11-16 11:10:57,844 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1954 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1071 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:57,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 1165 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1166 Invalid, 0 Unknown, 1071 Unchecked, 1.3s Time] [2022-11-16 11:10:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-11-16 11:10:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-11-16 11:10:57,850 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-11-16 11:10:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-11-16 11:10:57,851 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-11-16 11:10:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:57,852 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-11-16 11:10:57,852 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-11-16 11:10:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-11-16 11:10:57,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:10:57,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:57,853 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-11-16 11:10:57,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:58,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:58,060 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-11-16 11:10:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:58,060 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-11-16 11:10:58,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:58,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679684856] [2022-11-16 11:10:58,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:58,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:58,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679684856] [2022-11-16 11:10:58,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679684856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:58,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:58,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:10:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041491953] [2022-11-16 11:10:58,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:58,133 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-11-16 11:10:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:58,142 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-11-16 11:10:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:58,143 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-11-16 11:10:58,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:58,144 INFO L225 Difference]: With dead ends: 241 [2022-11-16 11:10:58,144 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 11:10:58,144 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-11-16 11:10:58,146 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-11-16 11:10:58,146 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-11-16 11:10:58,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 11:10:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-16 11:10:58,151 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-11-16 11:10:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-11-16 11:10:58,152 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-11-16 11:10:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:58,154 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-11-16 11:10:58,155 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-11-16 11:10:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-11-16 11:10:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:10:58,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:58,161 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-11-16 11:10:58,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:10:58,161 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-11-16 11:10:58,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-11-16 11:10:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:58,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455817914] [2022-11-16 11:10:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455817914] [2022-11-16 11:10:58,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455817914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:58,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:58,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:10:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033669463] [2022-11-16 11:10:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:58,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:10:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:10:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:10:58,334 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-11-16 11:10:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:58,600 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-11-16 11:10:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:10:58,601 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-11-16 11:10:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:58,602 INFO L225 Difference]: With dead ends: 258 [2022-11-16 11:10:58,603 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 11:10:58,603 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-11-16 11:10:58,604 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 51 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:58,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 554 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:10:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 11:10:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-11-16 11:10:58,609 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-11-16 11:10:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-11-16 11:10:58,610 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-11-16 11:10:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:58,610 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-11-16 11:10:58,610 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-11-16 11:10:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-11-16 11:10:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:10:58,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:58,612 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-11-16 11:10:58,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:10:58,612 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-11-16 11:10:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-11-16 11:10:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:58,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216458662] [2022-11-16 11:10:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:58,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:58,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:58,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216458662] [2022-11-16 11:10:58,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216458662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:58,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:58,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:58,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532255960] [2022-11-16 11:10:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:58,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:58,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:58,683 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-11-16 11:10:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:58,777 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-11-16 11:10:58,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:58,777 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-11-16 11:10:58,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:58,779 INFO L225 Difference]: With dead ends: 246 [2022-11-16 11:10:58,779 INFO L226 Difference]: Without dead ends: 246 [2022-11-16 11:10:58,779 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-11-16 11:10:58,780 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-11-16 11:10:58,780 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-11-16 11:10:58,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-16 11:10:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-11-16 11:10:58,786 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-11-16 11:10:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-16 11:10:58,787 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-11-16 11:10:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:58,788 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-16 11:10:58,788 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-11-16 11:10:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-16 11:10:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:10:58,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:58,789 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-11-16 11:10:58,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:10:58,790 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-11-16 11:10:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-11-16 11:10:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:58,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506233228] [2022-11-16 11:10:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:58,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506233228] [2022-11-16 11:10:58,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506233228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:58,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:58,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:10:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76260768] [2022-11-16 11:10:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:58,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:10:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:58,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:10:58,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:10:58,940 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-11-16 11:10:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:59,047 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-11-16 11:10:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:10:59,048 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-11-16 11:10:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:59,049 INFO L225 Difference]: With dead ends: 241 [2022-11-16 11:10:59,049 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 11:10:59,050 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-11-16 11:10:59,050 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-11-16 11:10:59,051 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-11-16 11:10:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 11:10:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-16 11:10:59,056 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-11-16 11:10:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-11-16 11:10:59,057 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-11-16 11:10:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:59,058 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-11-16 11:10:59,058 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-11-16 11:10:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-11-16 11:10:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:10:59,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:59,059 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-11-16 11:10:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:10:59,060 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-11-16 11:10:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-11-16 11:10:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:59,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518559772] [2022-11-16 11:10:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:10:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518559772] [2022-11-16 11:10:59,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518559772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:59,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:59,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:10:59,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312269000] [2022-11-16 11:10:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:59,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:10:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:59,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:10:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:10:59,161 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-11-16 11:10:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:59,508 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-11-16 11:10:59,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:10:59,509 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-11-16 11:10:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:59,510 INFO L225 Difference]: With dead ends: 261 [2022-11-16 11:10:59,510 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 11:10:59,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:10:59,511 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:59,512 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.3s Time] [2022-11-16 11:10:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 11:10:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-11-16 11:10:59,516 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-11-16 11:10:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-11-16 11:10:59,517 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-11-16 11:10:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:59,518 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-11-16 11:10:59,518 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-11-16 11:10:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-11-16 11:10:59,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:10:59,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:59,519 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-11-16 11:10:59,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:10:59,521 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-11-16 11:10:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-11-16 11:10:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:59,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908639651] [2022-11-16 11:10:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908639651] [2022-11-16 11:11:00,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908639651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:00,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362716111] [2022-11-16 11:11:00,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:00,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:00,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:00,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:00,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:11:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 11:11:00,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:00,470 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-11-16 11:11:00,565 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:11:00,565 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-11-16 11:11:00,618 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-11-16 11:11:00,629 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-11-16 11:11:00,748 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:11:00,748 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-11-16 11:11:00,756 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-11-16 11:11:00,782 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-11-16 11:11:00,847 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-11-16 11:11:00,882 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-11-16 11:11:01,165 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-11-16 11:11:01,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:11:01,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:01,175 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-11-16 11:11:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:01,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:11:01,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:01,392 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-11-16 11:11:02,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:02,178 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-11-16 11:11:02,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:02,187 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-11-16 11:11:02,193 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-11-16 11:11:02,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:02,216 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-11-16 11:11:02,227 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-11-16 11:11:02,235 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-11-16 11:11:02,247 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-11-16 11:11:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:02,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362716111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:11:02,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:11:02,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-11-16 11:11:02,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523248626] [2022-11-16 11:11:02,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:11:02,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 11:11:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 11:11:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1776, Unknown=18, NotChecked=0, Total=1980 [2022-11-16 11:11:02,791 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-11-16 11:11:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:06,723 INFO L93 Difference]: Finished difference Result 521 states and 583 transitions. [2022-11-16 11:11:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-16 11:11:06,723 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-11-16 11:11:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:06,725 INFO L225 Difference]: With dead ends: 521 [2022-11-16 11:11:06,726 INFO L226 Difference]: Without dead ends: 521 [2022-11-16 11:11:06,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1121, Invalid=6516, Unknown=19, NotChecked=0, Total=7656 [2022-11-16 11:11:06,729 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1214 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1221 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:06,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2261 Invalid, 3515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2142 Invalid, 0 Unknown, 1221 Unchecked, 1.7s Time] [2022-11-16 11:11:06,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-11-16 11:11:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 227. [2022-11-16 11:11:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 226 states have internal predecessors, (261), 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-11-16 11:11:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2022-11-16 11:11:06,736 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2022-11-16 11:11:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:06,737 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2022-11-16 11:11:06,737 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-11-16 11:11:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2022-11-16 11:11:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 11:11:06,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:06,738 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-11-16 11:11:06,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:06,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:11:06,944 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-11-16 11:11:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-11-16 11:11:06,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:06,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638010909] [2022-11-16 11:11:06,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:06,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:11:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:07,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638010909] [2022-11-16 11:11:07,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638010909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:11:07,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:11:07,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:11:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037056322] [2022-11-16 11:11:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:11:07,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:11:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:11:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:11:07,057 INFO L87 Difference]: Start difference. First operand 227 states and 261 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-11-16 11:11:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:07,372 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-11-16 11:11:07,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:11:07,373 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-11-16 11:11:07,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:07,374 INFO L225 Difference]: With dead ends: 247 [2022-11-16 11:11:07,374 INFO L226 Difference]: Without dead ends: 247 [2022-11-16 11:11:07,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:11:07,375 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:07,375 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.3s Time] [2022-11-16 11:11:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-16 11:11:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-11-16 11:11:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 232 states have internal predecessors, (270), 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-11-16 11:11:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2022-11-16 11:11:07,380 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2022-11-16 11:11:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:07,380 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2022-11-16 11:11:07,380 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-11-16 11:11:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2022-11-16 11:11:07,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 11:11:07,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:07,381 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-11-16 11:11:07,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:11:07,381 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-11-16 11:11:07,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-11-16 11:11:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:07,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877696037] [2022-11-16 11:11:07,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:07,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:08,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877696037] [2022-11-16 11:11:08,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877696037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:08,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009085724] [2022-11-16 11:11:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:08,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:08,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:08,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:08,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:11:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:08,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:11:08,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:08,356 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-11-16 11:11:08,359 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-11-16 11:11:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 11:11:08,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:11:08,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009085724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:11:08,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:11:08,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-11-16 11:11:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109792287] [2022-11-16 11:11:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:11:08,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:11:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:08,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:11:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:11:08,421 INFO L87 Difference]: Start difference. First operand 233 states and 270 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-11-16 11:11:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:08,778 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-11-16 11:11:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:11:08,779 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-11-16 11:11:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:08,780 INFO L225 Difference]: With dead ends: 242 [2022-11-16 11:11:08,780 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 11:11:08,781 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-11-16 11:11:08,781 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:08,781 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.3s Time] [2022-11-16 11:11:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 11:11:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2022-11-16 11:11:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 230 states have internal predecessors, (265), 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-11-16 11:11:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2022-11-16 11:11:08,788 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2022-11-16 11:11:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:08,789 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2022-11-16 11:11:08,789 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-11-16 11:11:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2022-11-16 11:11:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 11:11:08,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:08,790 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-11-16 11:11:08,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:08,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:08,996 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-11-16 11:11:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-11-16 11:11:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:08,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230375909] [2022-11-16 11:11:08,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:09,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230375909] [2022-11-16 11:11:09,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230375909] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:09,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891753178] [2022-11-16 11:11:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:09,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:09,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:09,869 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:09,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:11:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:10,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 11:11:10,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:10,087 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-11-16 11:11:10,185 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:11:10,185 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-11-16 11:11:10,225 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-11-16 11:11:10,340 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:11:10,341 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-11-16 11:11:10,476 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:11:10,476 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-11-16 11:11:10,487 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-11-16 11:11:10,606 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-16 11:11:10,607 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-11-16 11:11:10,625 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 11:11:10,625 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-11-16 11:11:11,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:11:11,163 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-16 11:11:11,164 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-11-16 11:11:11,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:11:11,183 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:11:11,184 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-11-16 11:11:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:11:11,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:11:23,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:23,556 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-11-16 11:11:25,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:11:25,958 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-11-16 11:12:38,677 WARN L855 $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-11-16 11:12:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:41,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891753178] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:12:41,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:12:41,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2022-11-16 11:12:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448832908] [2022-11-16 11:12:41,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:12:41,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 11:12:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:41,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 11:12:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1432, Unknown=5, NotChecked=76, Total=1640 [2022-11-16 11:12:41,537 INFO L87 Difference]: Start difference. First operand 231 states and 265 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-11-16 11:12:44,232 WARN L855 $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-11-16 11:12:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:46,803 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2022-11-16 11:12:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:12:46,803 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-11-16 11:12:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:46,805 INFO L225 Difference]: With dead ends: 266 [2022-11-16 11:12:46,805 INFO L226 Difference]: Without dead ends: 266 [2022-11-16 11:12:46,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=252, Invalid=2300, Unknown=6, NotChecked=198, Total=2756 [2022-11-16 11:12:46,807 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 171 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 561 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:46,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1992 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1315 Invalid, 0 Unknown, 561 Unchecked, 2.0s Time] [2022-11-16 11:12:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-16 11:12:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2022-11-16 11:12:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 233 states have internal predecessors, (268), 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-11-16 11:12:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 268 transitions. [2022-11-16 11:12:46,813 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 268 transitions. Word has length 40 [2022-11-16 11:12:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:46,814 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 268 transitions. [2022-11-16 11:12:46,814 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-11-16 11:12:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-11-16 11:12:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 11:12:46,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:46,815 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-11-16 11:12:46,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:47,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:12:47,022 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-11-16 11:12:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:47,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1306466284, now seen corresponding path program 1 times [2022-11-16 11:12:47,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:47,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384343331] [2022-11-16 11:12:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:47,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384343331] [2022-11-16 11:12:47,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384343331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:12:47,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129868433] [2022-11-16 11:12:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:12:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:47,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:12:47,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:12:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:48,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:12:48,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:48,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:12:48,654 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-11-16 11:12:48,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 14 treesize of output 16 [2022-11-16 11:12:48,743 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-11-16 11:12:48,765 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-11-16 11:12:48,776 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-11-16 11:12:48,795 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-11-16 11:12:48,801 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-11-16 11:12:48,876 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-11-16 11:12:48,884 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-11-16 11:12:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:48,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:12:48,981 WARN L833 $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-11-16 11:12:49,483 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-11-16 11:12:49,490 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-11-16 11:12:49,846 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-11-16 11:12:50,027 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:12:50,028 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-11-16 11:12:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:50,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129868433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:12:50,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:12:50,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-11-16 11:12:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257820201] [2022-11-16 11:12:50,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:12:50,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:12:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:12:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:12:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=922, Unknown=3, NotChecked=62, Total=1122 [2022-11-16 11:12:50,043 INFO L87 Difference]: Start difference. First operand 234 states and 268 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-11-16 11:12:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:12:56,894 INFO L93 Difference]: Finished difference Result 454 states and 503 transitions. [2022-11-16 11:12:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-16 11:12:56,895 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-11-16 11:12:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:12:56,898 INFO L225 Difference]: With dead ends: 454 [2022-11-16 11:12:56,898 INFO L226 Difference]: Without dead ends: 454 [2022-11-16 11:12:56,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1503, Invalid=7808, Unknown=5, NotChecked=190, Total=9506 [2022-11-16 11:12:56,901 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1141 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 2880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1366 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:12:56,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1146 Invalid, 2880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1372 Invalid, 0 Unknown, 1366 Unchecked, 2.0s Time] [2022-11-16 11:12:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-16 11:12:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 244. [2022-11-16 11:12:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 243 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-11-16 11:12:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2022-11-16 11:12:56,909 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 42 [2022-11-16 11:12:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:12:56,909 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2022-11-16 11:12:56,910 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-11-16 11:12:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2022-11-16 11:12:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 11:12:56,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:12:56,911 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-11-16 11:12:56,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:12:57,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:12:57,117 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-11-16 11:12:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:12:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1830693833, now seen corresponding path program 1 times [2022-11-16 11:12:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:12:57,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132496823] [2022-11-16 11:12:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:12:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:12:58,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:12:58,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132496823] [2022-11-16 11:12:58,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132496823] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:12:58,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520967597] [2022-11-16 11:12:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:12:58,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:12:58,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:12:58,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:12:58,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:12:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:12:58,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 11:12:58,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:12:59,138 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:12:59,138 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-11-16 11:12:59,196 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 11:12:59,197 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-11-16 11:12:59,465 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-16 11:12:59,465 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-11-16 11:12:59,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:12:59,491 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 11:12:59,491 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-11-16 11:12:59,500 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-11-16 11:13:00,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:13:00,762 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-16 11:13:00,763 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-11-16 11:13:00,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:13:00,786 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-16 11:13:00,786 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-11-16 11:13:00,957 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-11-16 11:13:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:13:00,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:13:01,795 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-11-16 11:13:01,886 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-11-16 11:13:05,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:05,690 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-11-16 11:13:05,801 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:13:05,802 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-11-16 11:14:21,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520967597] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:14:21,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:14:21,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 40 [2022-11-16 11:14:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787731456] [2022-11-16 11:14:21,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:21,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 11:14:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:21,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 11:14:21,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2022-11-16 11:14:21,998 INFO L87 Difference]: Start difference. First operand 244 states and 277 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-11-16 11:14:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:30,886 INFO L93 Difference]: Finished difference Result 405 states and 450 transitions. [2022-11-16 11:14:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 11:14:30,887 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-11-16 11:14:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:30,888 INFO L225 Difference]: With dead ends: 405 [2022-11-16 11:14:30,888 INFO L226 Difference]: Without dead ends: 405 [2022-11-16 11:14:30,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=742, Invalid=4370, Unknown=0, NotChecked=0, Total=5112 [2022-11-16 11:14:30,891 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 924 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:30,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1668 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1779 Invalid, 0 Unknown, 528 Unchecked, 3.1s Time] [2022-11-16 11:14:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-11-16 11:14:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 252. [2022-11-16 11:14:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 225 states have (on average 1.2755555555555556) internal successors, (287), 251 states have internal predecessors, (287), 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-11-16 11:14:30,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 287 transitions. [2022-11-16 11:14:30,899 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 287 transitions. Word has length 42 [2022-11-16 11:14:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:30,900 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 287 transitions. [2022-11-16 11:14:30,900 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-11-16 11:14:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 287 transitions. [2022-11-16 11:14:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:14:30,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:30,901 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-11-16 11:14:30,914 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:31,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:31,107 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-11-16 11:14:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 916938157, now seen corresponding path program 1 times [2022-11-16 11:14:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:31,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584512566] [2022-11-16 11:14:31,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:32,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584512566] [2022-11-16 11:14:32,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584512566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:32,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712943287] [2022-11-16 11:14:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:32,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:32,105 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:32,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:14:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:14:32,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:32,607 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 11:14:32,609 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-11-16 11:14:32,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:14:32,743 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 11:14:32,744 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-11-16 11:14:33,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:14:33,337 INFO L321 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2022-11-16 11:14:33,338 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-11-16 11:14:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:33,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:33,447 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-11-16 11:14:34,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:34,100 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-11-16 11:14:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712943287] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:14:34,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:14:34,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 32 [2022-11-16 11:14:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331122489] [2022-11-16 11:14:34,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:14:34,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 11:14:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 11:14:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 11:14:34,671 INFO L87 Difference]: Start difference. First operand 252 states and 287 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-11-16 11:14:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:41,560 INFO L93 Difference]: Finished difference Result 508 states and 571 transitions. [2022-11-16 11:14:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 11:14:41,561 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-11-16 11:14:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:41,563 INFO L225 Difference]: With dead ends: 508 [2022-11-16 11:14:41,564 INFO L226 Difference]: Without dead ends: 508 [2022-11-16 11:14:41,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2140 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1479, Invalid=5327, Unknown=0, NotChecked=0, Total=6806 [2022-11-16 11:14:41,566 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 2001 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2001 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:41,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2001 Valid, 1206 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1161 Invalid, 0 Unknown, 216 Unchecked, 1.8s Time] [2022-11-16 11:14:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-11-16 11:14:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 287. [2022-11-16 11:14:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 286 states have internal predecessors, (332), 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-11-16 11:14:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 332 transitions. [2022-11-16 11:14:41,575 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 332 transitions. Word has length 43 [2022-11-16 11:14:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:41,576 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 332 transitions. [2022-11-16 11:14:41,576 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-11-16 11:14:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 332 transitions. [2022-11-16 11:14:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:14:41,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:41,577 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-11-16 11:14:41,589 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:41,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:41,784 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-11-16 11:14:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash -377567726, now seen corresponding path program 1 times [2022-11-16 11:14:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985583016] [2022-11-16 11:14:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:43,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:43,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985583016] [2022-11-16 11:14:43,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985583016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:43,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755676121] [2022-11-16 11:14:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:43,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:43,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:43,089 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:43,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:14:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:43,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 11:14:43,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:43,326 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-11-16 11:14:43,546 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:14:43,546 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-11-16 11:14:43,634 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-11-16 11:14:43,859 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:43,860 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-11-16 11:14:44,088 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:44,088 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-11-16 11:14:44,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:14:44,178 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-11-16 11:14:44,701 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-16 11:14:44,701 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-11-16 11:14:44,805 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-11-16 11:14:44,847 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-11-16 11:14:44,881 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-11-16 11:14:44,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:14:44,935 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-11-16 11:14:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:45,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:14:48,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:48,852 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-11-16 11:14:48,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:48,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 1750 treesize of output 1629 [2022-11-16 11:14:48,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:14:48,924 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-11-16 11:14:48,942 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-11-16 11:14:48,964 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-11-16 11:15:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:15:28,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755676121] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:15:28,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:15:28,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 15] total 41 [2022-11-16 11:15:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255831460] [2022-11-16 11:15:28,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:15:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-16 11:15:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-16 11:15:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1493, Unknown=26, NotChecked=0, Total=1722 [2022-11-16 11:15:28,391 INFO L87 Difference]: Start difference. First operand 287 states and 332 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-11-16 11:15:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:31,701 INFO L93 Difference]: Finished difference Result 441 states and 497 transitions. [2022-11-16 11:15:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:15:31,702 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-11-16 11:15:31,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:31,704 INFO L225 Difference]: With dead ends: 441 [2022-11-16 11:15:31,704 INFO L226 Difference]: Without dead ends: 441 [2022-11-16 11:15:31,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=462, Invalid=2482, Unknown=26, NotChecked=0, Total=2970 [2022-11-16 11:15:31,707 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1176 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:31,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1684 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 962 Invalid, 0 Unknown, 1312 Unchecked, 1.9s Time] [2022-11-16 11:15:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-11-16 11:15:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 296. [2022-11-16 11:15:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 269 states have (on average 1.275092936802974) internal successors, (343), 295 states have internal predecessors, (343), 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-11-16 11:15:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 343 transitions. [2022-11-16 11:15:31,718 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 343 transitions. Word has length 45 [2022-11-16 11:15:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:31,718 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 343 transitions. [2022-11-16 11:15:31,719 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-11-16 11:15:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 343 transitions. [2022-11-16 11:15:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:15:31,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:31,720 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-11-16 11:15:31,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:31,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:15:31,928 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-11-16 11:15:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -377567725, now seen corresponding path program 1 times [2022-11-16 11:15:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349256148] [2022-11-16 11:15:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:31,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:15:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:34,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349256148] [2022-11-16 11:15:34,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349256148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:34,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830022266] [2022-11-16 11:15:34,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:34,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:34,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:34,218 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:34,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:15:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:34,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 11:15:34,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:34,475 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-11-16 11:15:34,719 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:15:34,720 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-11-16 11:15:34,741 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-11-16 11:15:34,878 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-11-16 11:15:34,902 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-11-16 11:15:35,264 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:15:35,264 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-11-16 11:15:35,280 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-11-16 11:15:35,638 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:15:35,638 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-11-16 11:15:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:15:35,673 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-11-16 11:15:35,819 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:15:35,820 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-11-16 11:15:35,837 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-11-16 11:15:36,760 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:15:36,761 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-11-16 11:15:36,822 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 11:15:36,823 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-11-16 11:15:36,978 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-11-16 11:15:37,000 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-11-16 11:15:37,028 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-11-16 11:15:37,040 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-11-16 11:15:37,078 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-11-16 11:15:37,088 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-11-16 11:15:37,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:15:37,254 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-11-16 11:15:37,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:15:37,266 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-11-16 11:15:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:15:37,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:15:37,472 WARN L833 $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-11-16 11:15:52,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:52,745 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-11-16 11:15:52,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:52,756 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-11-16 11:15:52,764 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-11-16 11:15:52,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:52,787 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-11-16 11:15:52,800 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-11-16 11:15:52,812 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-11-16 11:15:52,831 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-11-16 11:15:52,844 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-11-16 11:15:53,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:53,352 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-11-16 11:15:53,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:53,366 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-11-16 11:15:53,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:15:53,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:53,392 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-11-16 11:15:53,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:15:53,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:53,429 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-11-16 11:15:53,453 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-11-16 11:15:53,470 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-11-16 11:15:53,487 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-11-16 11:15:53,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:15:53,518 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-11-16 11:15:59,155 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-11-16 11:16:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:06,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830022266] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:16:06,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:16:06,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 42 [2022-11-16 11:16:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252380624] [2022-11-16 11:16:06,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:06,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 11:16:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 11:16:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1529, Unknown=14, NotChecked=80, Total=1806 [2022-11-16 11:16:06,406 INFO L87 Difference]: Start difference. First operand 296 states and 343 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-11-16 11:16:11,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:11,794 INFO L93 Difference]: Finished difference Result 390 states and 444 transitions. [2022-11-16 11:16:11,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:16:11,794 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-11-16 11:16:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:11,796 INFO L225 Difference]: With dead ends: 390 [2022-11-16 11:16:11,796 INFO L226 Difference]: Without dead ends: 390 [2022-11-16 11:16:11,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=575, Invalid=3075, Unknown=14, NotChecked=118, Total=3782 [2022-11-16 11:16:11,797 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 924 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:11,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1590 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1150 Invalid, 0 Unknown, 1176 Unchecked, 2.0s Time] [2022-11-16 11:16:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-16 11:16:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 296. [2022-11-16 11:16:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 269 states have (on average 1.271375464684015) internal successors, (342), 295 states have internal predecessors, (342), 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-11-16 11:16:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 342 transitions. [2022-11-16 11:16:11,806 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 342 transitions. Word has length 45 [2022-11-16 11:16:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:11,806 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 342 transitions. [2022-11-16 11:16:11,807 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-11-16 11:16:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 342 transitions. [2022-11-16 11:16:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-16 11:16:11,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:11,808 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-11-16 11:16:11,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:12,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:16:12,015 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-11-16 11:16:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1349607265, now seen corresponding path program 2 times [2022-11-16 11:16:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:12,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929761795] [2022-11-16 11:16:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:13,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929761795] [2022-11-16 11:16:13,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929761795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92167500] [2022-11-16 11:16:13,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:16:13,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:13,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:13,410 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:13,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce114a7-267b-49e8-a240-15014ecbfd74/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:16:13,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:16:13,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:13,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-16 11:16:13,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:13,630 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-11-16 11:16:13,807 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:16:13,807 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-11-16 11:16:13,865 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-11-16 11:16:14,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:16:14,077 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-11-16 11:16:14,282 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:16:14,282 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-11-16 11:16:14,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:16:14,432 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-11-16 11:16:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:14,500 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 11:16:14,500 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-11-16 11:16:14,596 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 11:16:14,596 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-11-16 11:16:14,843 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-16 11:16:14,844 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-11-16 11:16:15,122 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:16:15,123 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-11-16 11:16:15,251 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:16:15,252 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-11-16 11:16:15,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 11:16:15,734 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-16 11:16:15,734 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-11-16 11:16:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:16:15,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:16,877 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-11-16 11:16:16,877 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-11-16 11:16:16,898 WARN L833 $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-11-16 11:16:17,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:17,082 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-11-16 11:16:17,104 WARN L833 $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-11-16 11:16:18,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:18,055 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-11-16 11:16:18,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:18,099 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-11-16 11:16:18,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:18,358 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-11-16 11:16:18,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:18,498 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-11-16 11:16:18,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:16:18,638 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-11-16 11:16:18,767 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-11-16 11:16:18,973 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-16 11:16:18,973 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