./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/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_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- 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 12:32:42,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:32:42,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:32:42,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:32:42,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:32:42,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:32:42,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:32:42,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:32:42,037 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:32:42,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:32:42,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:32:42,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:32:42,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:32:42,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:32:42,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:32:42,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:32:42,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:32:42,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:32:42,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:32:42,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:32:42,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:32:42,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:32:42,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:32:42,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:32:42,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:32:42,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:32:42,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:32:42,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:32:42,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:32:42,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:32:42,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:32:42,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:32:42,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:32:42,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:32:42,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:32:42,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:32:42,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:32:42,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:32:42,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:32:42,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:32:42,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:32:42,074 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-16 12:32:42,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:32:42,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:32:42,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:32:42,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:32:42,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:32:42,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:32:42,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:32:42,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:32:42,127 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:32:42,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:32:42,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:32:42,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:32:42,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:32:42,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:32:42,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:32:42,130 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:32:42,130 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:32:42,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:32:42,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:32:42,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:32:42,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:32:42,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:32:42,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:32:42,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:32:42,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:32:42,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:32:42,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:32:42,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:32:42,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:32:42,134 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_4da81dae-89f9-4816-b939-34c8886effd5/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_4da81dae-89f9-4816-b939-34c8886effd5/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-memcleanup) ) 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 -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2022-11-16 12:32:42,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:32:42,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:32:42,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:32:42,454 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:32:42,454 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:32:42,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-11-16 12:32:42,530 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/data/762fee4c4/d6dae7e68ca0429bb0d6b2453ab8e708/FLAG3e49f124e [2022-11-16 12:32:43,100 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:32:43,101 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-11-16 12:32:43,113 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/data/762fee4c4/d6dae7e68ca0429bb0d6b2453ab8e708/FLAG3e49f124e [2022-11-16 12:32:43,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/data/762fee4c4/d6dae7e68ca0429bb0d6b2453ab8e708 [2022-11-16 12:32:43,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:32:43,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:32:43,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:32:43,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:32:43,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:32:43,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:43,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33e2e6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43, skipping insertion in model container [2022-11-16 12:32:43,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:43,462 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:32:43,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:32:43,824 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2022-11-16 12:32:43,833 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2022-11-16 12:32:43,838 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2022-11-16 12:32:43,839 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2022-11-16 12:32:43,840 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2022-11-16 12:32:43,841 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2022-11-16 12:32:43,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:32:43,864 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:32:43,904 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2022-11-16 12:32:43,923 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2022-11-16 12:32:43,927 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2022-11-16 12:32:43,928 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2022-11-16 12:32:43,934 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2022-11-16 12:32:43,936 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_4da81dae-89f9-4816-b939-34c8886effd5/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2022-11-16 12:32:43,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:32:43,979 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:32:43,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43 WrapperNode [2022-11-16 12:32:43,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:32:43,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:32:43,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:32:43,983 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:32:43,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,064 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-11-16 12:32:44,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:32:44,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:32:44,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:32:44,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:32:44,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:32:44,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:32:44,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:32:44,159 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:32:44,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (1/1) ... [2022-11-16 12:32:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:32:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:44,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:32:44,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:32:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:32:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:32:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:32:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:32:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:32:44,363 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:32:44,365 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:32:45,131 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:32:45,139 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:32:45,139 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-16 12:32:45,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:45 BoogieIcfgContainer [2022-11-16 12:32:45,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:32:45,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:32:45,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:32:45,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:32:45,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:43" (1/3) ... [2022-11-16 12:32:45,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7cd4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:45, skipping insertion in model container [2022-11-16 12:32:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:43" (2/3) ... [2022-11-16 12:32:45,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7cd4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:45, skipping insertion in model container [2022-11-16 12:32:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:45" (3/3) ... [2022-11-16 12:32:45,186 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2022-11-16 12:32:45,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:32:45,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-11-16 12:32:45,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:32:45,281 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;@18ba743d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:32:45,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-16 12:32:45,286 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 12:32:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:32:45,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:45,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:32:45,293 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 12:32:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-16 12:32:45,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:45,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284459581] [2022-11-16 12:32:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:45,492 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 12:32:45,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:45,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284459581] [2022-11-16 12:32:45,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284459581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:45,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:45,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:32:45,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784180133] [2022-11-16 12:32:45,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:32:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:32:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:32:45,533 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 12:32:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:45,696 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-11-16 12:32:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:32:45,698 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 12:32:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:45,707 INFO L225 Difference]: With dead ends: 182 [2022-11-16 12:32:45,707 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 12:32:45,709 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 12:32:45,712 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:45,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:32:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 12:32:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-11-16 12:32:45,750 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 12:32:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-11-16 12:32:45,754 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-11-16 12:32:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:45,755 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-11-16 12:32:45,755 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 12:32:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-11-16 12:32:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:32:45,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:45,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:32:45,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:32:45,757 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 12:32:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:45,758 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-16 12:32:45,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:45,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329255651] [2022-11-16 12:32:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:45,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:45,880 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 12:32:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:45,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329255651] [2022-11-16 12:32:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329255651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:45,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:45,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:32:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837610533] [2022-11-16 12:32:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:32:45,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:45,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:32:45,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:32:45,891 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 12:32:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:46,059 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-11-16 12:32:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:32:46,060 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 12:32:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:46,065 INFO L225 Difference]: With dead ends: 175 [2022-11-16 12:32:46,065 INFO L226 Difference]: Without dead ends: 175 [2022-11-16 12:32:46,066 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 12:32:46,069 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 12:32:46,071 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 12:32:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-16 12:32:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-11-16 12:32:46,090 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 12:32:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-11-16 12:32:46,096 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-11-16 12:32:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-11-16 12:32:46,098 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 12:32:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-11-16 12:32:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:32:46,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:46,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:46,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:32:46,101 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 12:32:46,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:46,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-11-16 12:32:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:46,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938509982] [2022-11-16 12:32:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:46,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:46,448 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 12:32:46,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938509982] [2022-11-16 12:32:46,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938509982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:46,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:46,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:32:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721511054] [2022-11-16 12:32:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:46,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:32:46,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:32:46,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:32:46,455 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 12:32:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:46,728 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-11-16 12:32:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:32:46,728 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 12:32:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:46,730 INFO L225 Difference]: With dead ends: 178 [2022-11-16 12:32:46,730 INFO L226 Difference]: Without dead ends: 178 [2022-11-16 12:32:46,731 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 12:32:46,734 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:46,736 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.2s Time] [2022-11-16 12:32:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-16 12:32:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-11-16 12:32:46,755 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 12:32:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-11-16 12:32:46,759 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-11-16 12:32:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:46,759 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-11-16 12:32:46,759 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 12:32:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-11-16 12:32:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:32:46,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:46,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:46,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:32:46,761 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 12:32:46,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:46,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-11-16 12:32:46,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:46,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792330038] [2022-11-16 12:32:46,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:47,043 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 12:32:47,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:47,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792330038] [2022-11-16 12:32:47,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792330038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:47,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:47,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:32:47,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304875138] [2022-11-16 12:32:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:47,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:32:47,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:32:47,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:32:47,046 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 12:32:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:47,401 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-11-16 12:32:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:32:47,402 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 12:32:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:47,403 INFO L225 Difference]: With dead ends: 258 [2022-11-16 12:32:47,403 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 12:32:47,404 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 12:32:47,404 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:47,405 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.3s Time] [2022-11-16 12:32:47,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 12:32:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-11-16 12:32:47,412 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 12:32:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-11-16 12:32:47,413 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-11-16 12:32:47,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:47,414 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-11-16 12:32:47,414 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 12:32:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-11-16 12:32:47,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:32:47,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:47,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:47,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:32:47,416 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 12:32:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-11-16 12:32:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:47,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333382312] [2022-11-16 12:32:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:47,450 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 12:32:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333382312] [2022-11-16 12:32:47,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333382312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:47,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:47,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:32:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070458609] [2022-11-16 12:32:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:47,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:32:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:32:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:32:47,454 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 12:32:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:47,492 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-11-16 12:32:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:32:47,493 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 12:32:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:47,496 INFO L225 Difference]: With dead ends: 266 [2022-11-16 12:32:47,496 INFO L226 Difference]: Without dead ends: 266 [2022-11-16 12:32:47,496 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 12:32:47,497 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 12:32:47,498 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 12:32:47,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-16 12:32:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-11-16 12:32:47,505 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 12:32:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-11-16 12:32:47,506 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-11-16 12:32:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:47,506 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-11-16 12:32:47,506 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 12:32:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-11-16 12:32:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:32:47,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:47,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:47,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:32:47,508 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 12:32:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-16 12:32:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:47,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96256351] [2022-11-16 12:32:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:47,789 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 12:32:47,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:47,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96256351] [2022-11-16 12:32:47,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96256351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:47,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:47,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:32:47,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301362769] [2022-11-16 12:32:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:47,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:32:47,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:47,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:32:47,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:32:47,792 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 12:32:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:48,041 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-11-16 12:32:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:32:48,041 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 12:32:48,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:48,042 INFO L225 Difference]: With dead ends: 232 [2022-11-16 12:32:48,042 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 12:32:48,043 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 12:32:48,043 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:48,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:32:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 12:32:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-11-16 12:32:48,048 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 12:32:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-11-16 12:32:48,049 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-11-16 12:32:48,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:48,049 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-11-16 12:32:48,049 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 12:32:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-11-16 12:32:48,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:32:48,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:48,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:48,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:32:48,050 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 12:32:48,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:48,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-16 12:32:48,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:48,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721689567] [2022-11-16 12:32:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:48,164 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 12:32:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:48,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721689567] [2022-11-16 12:32:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721689567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:48,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:32:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863920484] [2022-11-16 12:32:48,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:32:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:48,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:32:48,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:32:48,167 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 12:32:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:48,398 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-11-16 12:32:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:32:48,399 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 12:32:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:48,400 INFO L225 Difference]: With dead ends: 231 [2022-11-16 12:32:48,400 INFO L226 Difference]: Without dead ends: 231 [2022-11-16 12:32:48,401 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 12:32:48,402 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 12:32:48,402 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 12:32:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-16 12:32:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-11-16 12:32:48,408 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 12:32:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-11-16 12:32:48,409 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-11-16 12:32:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:48,410 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-11-16 12:32:48,410 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 12:32:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-11-16 12:32:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:32:48,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:48,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:48,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:32:48,412 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 12:32:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-16 12:32:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:48,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175354893] [2022-11-16 12:32:48,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:48,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:48,744 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 12:32:48,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:48,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175354893] [2022-11-16 12:32:48,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175354893] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:48,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:48,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:32:48,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980379508] [2022-11-16 12:32:48,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:48,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:32:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:48,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:32:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:32:48,747 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 12:32:49,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:49,192 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-11-16 12:32:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:32:49,193 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 12:32:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:49,194 INFO L225 Difference]: With dead ends: 237 [2022-11-16 12:32:49,194 INFO L226 Difference]: Without dead ends: 237 [2022-11-16 12:32:49,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:32:49,195 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 12:32:49,195 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 12:32:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-16 12:32:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-11-16 12:32:49,202 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 12:32:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-11-16 12:32:49,203 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-11-16 12:32:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:49,203 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-11-16 12:32:49,203 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 12:32:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-11-16 12:32:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:32:49,204 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:49,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:32:49,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:32:49,205 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 12:32:49,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-16 12:32:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:49,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726513655] [2022-11-16 12:32:49,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:49,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:49,645 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 12:32:49,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:49,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726513655] [2022-11-16 12:32:49,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726513655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:49,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:49,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:32:49,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410712307] [2022-11-16 12:32:49,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:49,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:32:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:32:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:32:49,648 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 12:32:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:50,380 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-11-16 12:32:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:32:50,381 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 12:32:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:50,382 INFO L225 Difference]: With dead ends: 232 [2022-11-16 12:32:50,382 INFO L226 Difference]: Without dead ends: 232 [2022-11-16 12:32:50,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:32:50,383 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 296 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:50,383 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.5s Time] [2022-11-16 12:32:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-16 12:32:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-11-16 12:32:50,387 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 12:32:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-11-16 12:32:50,390 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-11-16 12:32:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:50,390 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-11-16 12:32:50,390 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 12:32:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-11-16 12:32:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 12:32:50,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:50,392 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 12:32:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:32:50,392 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 12:32:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-11-16 12:32:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:50,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788049185] [2022-11-16 12:32:50,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:50,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:50,461 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 12:32:50,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:50,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788049185] [2022-11-16 12:32:50,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788049185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:32:50,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:32:50,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:32:50,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032464126] [2022-11-16 12:32:50,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:32:50,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:32:50,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:50,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:32:50,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:32:50,464 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 12:32:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:50,616 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-11-16 12:32:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:32:50,616 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 12:32:50,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:50,617 INFO L225 Difference]: With dead ends: 253 [2022-11-16 12:32:50,617 INFO L226 Difference]: Without dead ends: 253 [2022-11-16 12:32:50,618 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 12:32:50,618 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 297 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:50,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 202 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:32:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-16 12:32:50,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-11-16 12:32:50,623 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 12:32:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-11-16 12:32:50,624 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-11-16 12:32:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:50,624 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-11-16 12:32:50,624 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 12:32:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-11-16 12:32:50,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:32:50,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:50,625 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 12:32:50,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:32:50,626 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 12:32:50,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:50,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-11-16 12:32:50,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:50,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57969560] [2022-11-16 12:32:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:50,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:51,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:32:51,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57969560] [2022-11-16 12:32:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57969560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:51,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770126531] [2022-11-16 12:32:51,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:51,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:51,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:51,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:51,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:32:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:51,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-16 12:32:51,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:51,435 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 12:32:51,584 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:32:51,585 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 12:32:51,627 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 12:32:51,741 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:51,742 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 12:32:51,848 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:51,849 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 12:32:51,931 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:51,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-16 12:32:52,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:52,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:52,117 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 12:32:52,123 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 12:32:52,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:52,465 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-16 12:32:52,465 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 12:32:52,712 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 12:32:52,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:52,834 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 12:32:52,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:52,850 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 12:32:52,862 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 12:32:52,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:52,878 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 12:32:53,539 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 12:32:53,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770126531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:32:53,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:32:53,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-11-16 12:32:53,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905839604] [2022-11-16 12:32:53,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:32:53,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-16 12:32:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-16 12:32:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1006, Unknown=11, NotChecked=64, Total=1190 [2022-11-16 12:32:53,544 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 12:32:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:32:55,771 INFO L93 Difference]: Finished difference Result 419 states and 476 transitions. [2022-11-16 12:32:55,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:32:55,772 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 12:32:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:32:55,773 INFO L225 Difference]: With dead ends: 419 [2022-11-16 12:32:55,773 INFO L226 Difference]: Without dead ends: 419 [2022-11-16 12:32:55,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=438, Invalid=2311, Unknown=11, NotChecked=102, Total=2862 [2022-11-16 12:32:55,775 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1005 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:32:55,775 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.1s Time] [2022-11-16 12:32:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-16 12:32:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 239. [2022-11-16 12:32:55,780 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 12:32:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-11-16 12:32:55,781 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-11-16 12:32:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:32:55,782 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-11-16 12:32:55,782 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 12:32:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-11-16 12:32:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 12:32:55,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:32:55,787 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 12:32:55,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:32:55,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 12:32:55,993 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 12:32:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:32:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-11-16 12:32:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:32:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335825470] [2022-11-16 12:32:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:32:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:56,766 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 12:32:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:32:56,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335825470] [2022-11-16 12:32:56,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335825470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:32:56,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35824538] [2022-11-16 12:32:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:32:56,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:32:56,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:32:56,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:32:56,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:32:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:32:56,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 12:32:56,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:32:56,940 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 12:32:57,029 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:32:57,029 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 12:32:57,056 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 12:32:57,112 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 12:32:57,121 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 12:32:57,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:57,295 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 12:32:57,309 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 12:32:57,455 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:57,455 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 12:32:57,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:32:57,473 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 12:32:57,553 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:32:57,553 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 12:32:57,562 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 12:32:57,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:57,780 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 12:32:57,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:57,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:57,789 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 12:32:57,821 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 12:32:57,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:32:58,733 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 12:32:59,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:59,001 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 12:32:59,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:59,009 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 12:32:59,019 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 12:32:59,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:59,034 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 12:32:59,043 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 12:32:59,050 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 12:32:59,062 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 12:32:59,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:59,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 73 treesize of output 74 [2022-11-16 12:32:59,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:32:59,197 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 12:32:59,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:59,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:59,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:32:59,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:32:59,208 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 12:32:59,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:32:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:32:59,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:32:59,218 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 12:32:59,231 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 12:32:59,610 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 12:32:59,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35824538] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:32:59,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:32:59,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2022-11-16 12:32:59,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200298826] [2022-11-16 12:32:59,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:32:59,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 12:32:59,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:32:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 12:32:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1057, Unknown=12, NotChecked=66, Total=1260 [2022-11-16 12:32:59,614 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 12:33:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:01,921 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-11-16 12:33:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:33:01,921 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 12:33:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:01,926 INFO L225 Difference]: With dead ends: 418 [2022-11-16 12:33:01,926 INFO L226 Difference]: Without dead ends: 418 [2022-11-16 12:33:01,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=432, Invalid=2316, Unknown=12, NotChecked=102, Total=2862 [2022-11-16 12:33:01,935 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1954 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:33:01,935 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.1s Time] [2022-11-16 12:33:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-11-16 12:33:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-11-16 12:33:01,940 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 12:33:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-11-16 12:33:01,941 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-11-16 12:33:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:01,942 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-11-16 12:33:01,942 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 12:33:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-11-16 12:33:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 12:33:01,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:01,949 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 12:33:01,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 12:33:02,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:33:02,157 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 12:33:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-11-16 12:33:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:02,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238287485] [2022-11-16 12:33:02,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:02,201 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 12:33:02,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:02,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238287485] [2022-11-16 12:33:02,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238287485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:02,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:02,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:33:02,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657299057] [2022-11-16 12:33:02,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:02,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:33:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:33:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:33:02,204 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 12:33:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:02,216 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-11-16 12:33:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:33:02,217 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 12:33:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:02,218 INFO L225 Difference]: With dead ends: 241 [2022-11-16 12:33:02,218 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 12:33:02,218 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 12:33:02,220 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 12:33:02,220 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 12:33:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 12:33:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-16 12:33:02,225 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 12:33:02,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-11-16 12:33:02,226 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-11-16 12:33:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:02,227 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-11-16 12:33:02,227 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 12:33:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-11-16 12:33:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:33:02,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:02,229 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 12:33:02,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:33:02,230 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 12:33:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-11-16 12:33:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:02,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956058267] [2022-11-16 12:33:02,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:02,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:02,410 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 12:33:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956058267] [2022-11-16 12:33:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956058267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:02,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:02,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:33:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411128208] [2022-11-16 12:33:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:02,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:33:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:33:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:33:02,415 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 12:33:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:02,660 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-11-16 12:33:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:33:02,661 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 12:33:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:02,663 INFO L225 Difference]: With dead ends: 258 [2022-11-16 12:33:02,663 INFO L226 Difference]: Without dead ends: 258 [2022-11-16 12:33:02,663 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 12:33:02,664 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 12:33:02,664 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 12:33:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-16 12:33:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-11-16 12:33:02,668 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 12:33:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-11-16 12:33:02,669 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-11-16 12:33:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:02,670 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-11-16 12:33:02,670 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 12:33:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-11-16 12:33:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:33:02,673 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:02,674 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 12:33:02,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:33:02,674 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 12:33:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-11-16 12:33:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:02,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566419470] [2022-11-16 12:33:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:02,761 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 12:33:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:02,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566419470] [2022-11-16 12:33:02,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566419470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:02,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:02,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:33:02,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926505087] [2022-11-16 12:33:02,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:02,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:33:02,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:33:02,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:33:02,764 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 12:33:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:02,838 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-11-16 12:33:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:33:02,838 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 12:33:02,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:02,840 INFO L225 Difference]: With dead ends: 246 [2022-11-16 12:33:02,841 INFO L226 Difference]: Without dead ends: 246 [2022-11-16 12:33:02,842 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 12:33:02,844 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 12:33:02,844 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 12:33:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-16 12:33:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-11-16 12:33:02,848 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 12:33:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-11-16 12:33:02,849 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-11-16 12:33:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:02,850 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-11-16 12:33:02,851 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 12:33:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-11-16 12:33:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:33:02,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:02,852 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 12:33:02,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:33:02,852 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 12:33:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-11-16 12:33:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:02,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937287088] [2022-11-16 12:33:02,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:02,996 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 12:33:02,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:02,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937287088] [2022-11-16 12:33:02,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937287088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:02,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:33:02,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408822883] [2022-11-16 12:33:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:02,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:33:02,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:33:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:33:02,999 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 12:33:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:03,094 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-11-16 12:33:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:33:03,095 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 12:33:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:03,096 INFO L225 Difference]: With dead ends: 241 [2022-11-16 12:33:03,096 INFO L226 Difference]: Without dead ends: 241 [2022-11-16 12:33:03,097 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 12:33:03,097 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 12:33:03,098 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 12:33:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-16 12:33:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-16 12:33:03,104 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 12:33:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-11-16 12:33:03,105 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-11-16 12:33:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:03,106 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-11-16 12:33:03,106 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 12:33:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-11-16 12:33:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:33:03,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:03,108 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 12:33:03,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:33:03,108 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 12:33:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-11-16 12:33:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:03,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034811744] [2022-11-16 12:33:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:03,223 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 12:33:03,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:03,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034811744] [2022-11-16 12:33:03,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034811744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:03,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:03,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:33:03,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534025518] [2022-11-16 12:33:03,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:03,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:33:03,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:33:03,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:33:03,227 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 12:33:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:03,540 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-11-16 12:33:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:33:03,541 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 12:33:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:03,542 INFO L225 Difference]: With dead ends: 261 [2022-11-16 12:33:03,542 INFO L226 Difference]: Without dead ends: 261 [2022-11-16 12:33:03,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:33:03,543 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 12:33:03,543 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 12:33:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-16 12:33:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-11-16 12:33:03,547 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 12:33:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-11-16 12:33:03,547 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-11-16 12:33:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:03,548 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-11-16 12:33:03,548 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 12:33:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-11-16 12:33:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 12:33:03,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:03,548 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 12:33:03,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:33:03,549 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 12:33:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-11-16 12:33:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:03,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631605765] [2022-11-16 12:33:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:03,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:04,219 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 12:33:04,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631605765] [2022-11-16 12:33:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631605765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:33:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720753514] [2022-11-16 12:33:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:04,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:33:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:33:04,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:33:04,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:33:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:04,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-16 12:33:04,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:33:04,370 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 12:33:04,450 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:33:04,451 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 12:33:04,507 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 12:33:04,515 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 12:33:04,621 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:33:04,622 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 12:33:04,628 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 12:33:04,650 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 12:33:04,709 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 12:33:04,746 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 12:33:04,978 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 12:33:04,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:33:04,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:04,986 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 12:33:05,044 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 12:33:05,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:33:05,175 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:05,176 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 12:33:05,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:05,876 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 12:33:05,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:05,887 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 12:33:05,894 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 12:33:05,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:05,917 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 12:33:05,934 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 12:33:05,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 114 treesize of output 110 [2022-11-16 12:33:05,953 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 12:33:06,398 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 12:33:06,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720753514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:33:06,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:33:06,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-11-16 12:33:06,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526146914] [2022-11-16 12:33:06,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:33:06,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-16 12:33:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:06,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-16 12:33:06,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1776, Unknown=18, NotChecked=0, Total=1980 [2022-11-16 12:33:06,401 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 12:33:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:10,034 INFO L93 Difference]: Finished difference Result 521 states and 583 transitions. [2022-11-16 12:33:10,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-16 12:33:10,034 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 12:33:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:10,036 INFO L225 Difference]: With dead ends: 521 [2022-11-16 12:33:10,036 INFO L226 Difference]: Without dead ends: 521 [2022-11-16 12:33:10,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1121, Invalid=6516, Unknown=19, NotChecked=0, Total=7656 [2022-11-16 12:33:10,039 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1214 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:33:10,040 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.6s Time] [2022-11-16 12:33:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-11-16 12:33:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 227. [2022-11-16 12:33:10,045 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 12:33:10,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2022-11-16 12:33:10,046 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2022-11-16 12:33:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:10,046 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2022-11-16 12:33:10,047 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 12:33:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2022-11-16 12:33:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:33:10,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:10,048 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 12:33:10,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:33:10,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 12:33:10,253 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 12:33:10,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-11-16 12:33:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:10,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351462627] [2022-11-16 12:33:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:10,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:10,363 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 12:33:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351462627] [2022-11-16 12:33:10,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351462627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:10,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:33:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:33:10,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647481842] [2022-11-16 12:33:10,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:10,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:33:10,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:33:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:33:10,367 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 12:33:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:10,664 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-11-16 12:33:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:33:10,665 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 12:33:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:10,666 INFO L225 Difference]: With dead ends: 247 [2022-11-16 12:33:10,666 INFO L226 Difference]: Without dead ends: 247 [2022-11-16 12:33:10,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:33:10,667 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 12:33:10,667 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 12:33:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-16 12:33:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-11-16 12:33:10,672 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 12:33:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2022-11-16 12:33:10,673 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2022-11-16 12:33:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:10,674 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2022-11-16 12:33:10,674 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 12:33:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2022-11-16 12:33:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:33:10,675 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:10,675 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 12:33:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 12:33:10,675 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 12:33:10,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-11-16 12:33:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:10,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893532194] [2022-11-16 12:33:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:10,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:11,327 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 12:33:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893532194] [2022-11-16 12:33:11,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893532194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:33:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030449243] [2022-11-16 12:33:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:11,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:33:11,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:33:11,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:33:11,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:33:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:11,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:33:11,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:33:11,580 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 12:33:11,583 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 12:33:11,635 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 12:33:11,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:33:11,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030449243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:33:11,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:33:11,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-11-16 12:33:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841077774] [2022-11-16 12:33:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:33:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:33:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:33:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:33:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:33:11,639 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 12:33:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:33:11,944 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-11-16 12:33:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:33:11,946 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 12:33:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:33:11,947 INFO L225 Difference]: With dead ends: 242 [2022-11-16 12:33:11,947 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 12:33:11,947 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 12:33:11,948 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:33:11,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:33:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 12:33:11,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2022-11-16 12:33:11,952 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 12:33:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2022-11-16 12:33:11,953 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2022-11-16 12:33:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:33:11,954 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2022-11-16 12:33:11,954 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 12:33:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2022-11-16 12:33:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-16 12:33:11,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:33:11,955 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 12:33:11,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:33:12,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:33:12,167 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 12:33:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:33:12,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-11-16 12:33:12,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:33:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046096025] [2022-11-16 12:33:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:33:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:12,940 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 12:33:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:33:12,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046096025] [2022-11-16 12:33:12,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046096025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:33:12,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583221842] [2022-11-16 12:33:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:33:12,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:33:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:33:12,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:33:12,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:33:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:33:13,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-16 12:33:13,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:33:13,137 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 12:33:13,229 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:33:13,230 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 12:33:13,266 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 12:33:13,370 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:33:13,370 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 12:33:13,480 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 12:33:13,480 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 12:33:13,490 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 12:33:13,595 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-11-16 12:33:13,595 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 12:33:13,610 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-16 12:33:13,611 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 12:33:14,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:33:14,090 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-16 12:33:14,090 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 12:33:14,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:33:14,108 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:33:14,109 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 12:33:14,118 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 12:33:14,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:33:31,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:31,513 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 12:33:33,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:33:33,810 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 12:34:46,650 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 12:34:49,631 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 12:34:49,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583221842] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:34:49,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:34:49,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 41 [2022-11-16 12:34:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087726405] [2022-11-16 12:34:49,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:34:49,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 12:34:49,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:34:49,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 12:34:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1429, Unknown=9, NotChecked=76, Total=1640 [2022-11-16 12:34:49,635 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 12:34:52,454 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 12:34:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:34:55,064 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2022-11-16 12:34:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 12:34:55,065 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 12:34:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:34:55,067 INFO L225 Difference]: With dead ends: 266 [2022-11-16 12:34:55,067 INFO L226 Difference]: Without dead ends: 266 [2022-11-16 12:34:55,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=251, Invalid=2297, Unknown=10, NotChecked=198, Total=2756 [2022-11-16 12:34:55,068 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 171 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 639 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:34:55,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2053 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1315 Invalid, 0 Unknown, 639 Unchecked, 2.0s Time] [2022-11-16 12:34:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-16 12:34:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 234. [2022-11-16 12:34:55,074 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 12:34:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 268 transitions. [2022-11-16 12:34:55,075 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 268 transitions. Word has length 40 [2022-11-16 12:34:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:34:55,076 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 268 transitions. [2022-11-16 12:34:55,076 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 12:34:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 268 transitions. [2022-11-16 12:34:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:34:55,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:34:55,077 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 12:34:55,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:34:55,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:34:55,278 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 12:34:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:34:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1306466284, now seen corresponding path program 1 times [2022-11-16 12:34:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:34:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465165429] [2022-11-16 12:34:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:34:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:34:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:34:56,066 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 12:34:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:34:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465165429] [2022-11-16 12:34:56,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465165429] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:34:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757268222] [2022-11-16 12:34:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:34:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:34:56,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:34:56,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:34:56,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:34:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:34:56,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 12:34:56,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:34:56,802 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 12:34:56,803 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 12:34:56,867 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 12:34:56,876 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 12:34:56,894 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 12:34:56,905 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 12:34:56,923 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 12:34:56,930 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 12:34:57,011 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 12:34:57,020 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 12:34:57,088 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 12:34:57,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:34:57,122 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 12:34:57,592 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 12:34:57,597 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 12:34:57,983 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 12:34:58,192 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:34:58,192 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 12:34:58,202 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 12:34:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757268222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:34:58,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:34:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 34 [2022-11-16 12:34:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608285278] [2022-11-16 12:34:58,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:34:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 12:34:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:34:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 12:34:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=923, Unknown=2, NotChecked=62, Total=1122 [2022-11-16 12:34:58,205 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 12:35:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:35:05,301 INFO L93 Difference]: Finished difference Result 454 states and 503 transitions. [2022-11-16 12:35:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-16 12:35:05,305 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 12:35:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:35:05,307 INFO L225 Difference]: With dead ends: 454 [2022-11-16 12:35:05,307 INFO L226 Difference]: Without dead ends: 454 [2022-11-16 12:35:05,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1500, Invalid=7809, Unknown=7, NotChecked=190, Total=9506 [2022-11-16 12:35:05,311 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1141 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1368 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:35:05,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 1146 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1372 Invalid, 0 Unknown, 1368 Unchecked, 2.0s Time] [2022-11-16 12:35:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-16 12:35:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 244. [2022-11-16 12:35:05,319 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 12:35:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 277 transitions. [2022-11-16 12:35:05,320 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 277 transitions. Word has length 42 [2022-11-16 12:35:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:35:05,320 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 277 transitions. [2022-11-16 12:35:05,321 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 12:35:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 277 transitions. [2022-11-16 12:35:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-16 12:35:05,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:35:05,322 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 12:35:05,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:35:05,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:35:05,537 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 12:35:05,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:35:05,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1830693833, now seen corresponding path program 1 times [2022-11-16 12:35:05,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:35:05,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626929675] [2022-11-16 12:35:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:35:05,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:35:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:35:05,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:35:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:35:05,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:35:05,605 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:35:05,606 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (79 of 80 remaining) [2022-11-16 12:35:05,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 80 remaining) [2022-11-16 12:35:05,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 80 remaining) [2022-11-16 12:35:05,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 80 remaining) [2022-11-16 12:35:05,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 80 remaining) [2022-11-16 12:35:05,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 80 remaining) [2022-11-16 12:35:05,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 80 remaining) [2022-11-16 12:35:05,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 80 remaining) [2022-11-16 12:35:05,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 80 remaining) [2022-11-16 12:35:05,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 80 remaining) [2022-11-16 12:35:05,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 80 remaining) [2022-11-16 12:35:05,610 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 80 remaining) [2022-11-16 12:35:05,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 80 remaining) [2022-11-16 12:35:05,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 80 remaining) [2022-11-16 12:35:05,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 80 remaining) [2022-11-16 12:35:05,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 80 remaining) [2022-11-16 12:35:05,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 80 remaining) [2022-11-16 12:35:05,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 80 remaining) [2022-11-16 12:35:05,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 80 remaining) [2022-11-16 12:35:05,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 80 remaining) [2022-11-16 12:35:05,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 80 remaining) [2022-11-16 12:35:05,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (58 of 80 remaining) [2022-11-16 12:35:05,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 80 remaining) [2022-11-16 12:35:05,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 80 remaining) [2022-11-16 12:35:05,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 80 remaining) [2022-11-16 12:35:05,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 80 remaining) [2022-11-16 12:35:05,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 80 remaining) [2022-11-16 12:35:05,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 80 remaining) [2022-11-16 12:35:05,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 80 remaining) [2022-11-16 12:35:05,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 80 remaining) [2022-11-16 12:35:05,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 80 remaining) [2022-11-16 12:35:05,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 80 remaining) [2022-11-16 12:35:05,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 80 remaining) [2022-11-16 12:35:05,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 80 remaining) [2022-11-16 12:35:05,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 80 remaining) [2022-11-16 12:35:05,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 80 remaining) [2022-11-16 12:35:05,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 80 remaining) [2022-11-16 12:35:05,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 80 remaining) [2022-11-16 12:35:05,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 80 remaining) [2022-11-16 12:35:05,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 80 remaining) [2022-11-16 12:35:05,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 80 remaining) [2022-11-16 12:35:05,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 80 remaining) [2022-11-16 12:35:05,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 80 remaining) [2022-11-16 12:35:05,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 80 remaining) [2022-11-16 12:35:05,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 80 remaining) [2022-11-16 12:35:05,617 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 80 remaining) [2022-11-16 12:35:05,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 80 remaining) [2022-11-16 12:35:05,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 80 remaining) [2022-11-16 12:35:05,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 80 remaining) [2022-11-16 12:35:05,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 80 remaining) [2022-11-16 12:35:05,618 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 80 remaining) [2022-11-16 12:35:05,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 80 remaining) [2022-11-16 12:35:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 80 remaining) [2022-11-16 12:35:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 80 remaining) [2022-11-16 12:35:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 80 remaining) [2022-11-16 12:35:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 80 remaining) [2022-11-16 12:35:05,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 80 remaining) [2022-11-16 12:35:05,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (17 of 80 remaining) [2022-11-16 12:35:05,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (16 of 80 remaining) [2022-11-16 12:35:05,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 80 remaining) [2022-11-16 12:35:05,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 80 remaining) [2022-11-16 12:35:05,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 80 remaining) [2022-11-16 12:35:05,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 80 remaining) [2022-11-16 12:35:05,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 80 remaining) [2022-11-16 12:35:05,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 80 remaining) [2022-11-16 12:35:05,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK (9 of 80 remaining) [2022-11-16 12:35:05,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (8 of 80 remaining) [2022-11-16 12:35:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 80 remaining) [2022-11-16 12:35:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 80 remaining) [2022-11-16 12:35:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 80 remaining) [2022-11-16 12:35:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 80 remaining) [2022-11-16 12:35:05,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (3 of 80 remaining) [2022-11-16 12:35:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (2 of 80 remaining) [2022-11-16 12:35:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE (1 of 80 remaining) [2022-11-16 12:35:05,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_LEAK (0 of 80 remaining) [2022-11-16 12:35:05,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 12:35:05,627 INFO L444 BasicCegarLoop]: Path program histogram: [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 12:35:05,632 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:35:05,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:35:05 BoogieIcfgContainer [2022-11-16 12:35:05,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:35:05,676 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:35:05,676 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:35:05,676 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:35:05,677 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:45" (3/4) ... [2022-11-16 12:35:05,679 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 12:35:05,742 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:35:05,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:35:05,743 INFO L158 Benchmark]: Toolchain (without parser) took 142296.51ms. Allocated memory was 113.2MB in the beginning and 408.9MB in the end (delta: 295.7MB). Free memory was 77.6MB in the beginning and 254.1MB in the end (delta: -176.5MB). Peak memory consumption was 118.9MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,744 INFO L158 Benchmark]: CDTParser took 2.03ms. Allocated memory is still 113.2MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:35:05,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.40ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 79.8MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.85ms. Allocated memory is still 113.2MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,745 INFO L158 Benchmark]: Boogie Preprocessor took 86.95ms. Allocated memory is still 113.2MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,748 INFO L158 Benchmark]: RCFGBuilder took 990.46ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 75.6MB in the beginning and 126.4MB in the end (delta: -50.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,748 INFO L158 Benchmark]: TraceAbstraction took 140523.69ms. Allocated memory was 153.1MB in the beginning and 408.9MB in the end (delta: 255.9MB). Free memory was 125.7MB in the beginning and 256.2MB in the end (delta: -130.4MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,748 INFO L158 Benchmark]: Witness Printer took 66.87ms. Allocated memory is still 408.9MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:35:05,759 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.03ms. Allocated memory is still 113.2MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.40ms. Allocated memory is still 113.2MB. Free memory was 77.3MB in the beginning and 79.8MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.85ms. Allocated memory is still 113.2MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.95ms. Allocated memory is still 113.2MB. Free memory was 77.7MB in the beginning and 75.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 990.46ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 75.6MB in the beginning and 126.4MB in the end (delta: -50.8MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 140523.69ms. Allocated memory was 153.1MB in the beginning and 408.9MB in the end (delta: 255.9MB). Free memory was 125.7MB in the beginning and 256.2MB in the end (delta: -130.4MB). Peak memory consumption was 126.2MB. Max. memory is 16.1GB. * Witness Printer took 66.87ms. Allocated memory is still 408.9MB. Free memory was 256.2MB in the beginning and 254.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1038]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] head->data = 0 VAL [head={-1:0}] [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, marked=0, x={-1:0}] [L1010] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1010] x->next->prev = x VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1011] x = x->next [L1012] x->next = ((void*)0) VAL [head={-1:0}, marked=0, x={-2:0}] [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) VAL [head={-1:0}, marked=1, x={-2:0}] [L1020] x->data = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, marked=1, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, marked=1, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, marked=0, x={-1:0}] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1] [L1030] EXPR x->next->data VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=1, x->next->data=1] [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next={-2:0}, x->next != ((void*)0) && x->next->data == 0=0, x->next->data=1] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=3, head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}, x->next != ((void*)0) && __VERIFIER_nondet_int()=1] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next VAL [head={-1:0}, marked=0, x={-1:0}, x->next={-2:0}] [L1037] x = x->next [L1038] EXPR x->data VAL [head={-1:0}, marked=0, x={-2:0}, x->data=1] [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, marked=0, x={-2:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1070]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1079]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 179 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 140.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8070 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8070 mSDsluCounter, 12853 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5682 IncrementalHoareTripleChecker+Unchecked, 10395 mSDsCounter, 713 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10808 IncrementalHoareTripleChecker+Invalid, 17203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 713 mSolverCounterUnsat, 2458 mSDtfsCounter, 10808 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 344 SyntacticMatches, 7 SemanticMatches, 443 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6574 ImplicationChecksByTransitivity, 39.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=249occurred in iteration=14, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 1103 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 111.9s InterpolantComputationTime, 815 NumberOfCodeBlocks, 815 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 920 ConstructedInterpolants, 90 QuantifiedInterpolants, 20157 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1535 ConjunctsInSsa, 237 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 24/68 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 12:35:05,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4da81dae-89f9-4816-b939-34c8886effd5/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)